Fetching the paper…
Reading the bibliography…
The Travelling Salesman Problem is one of the most famous problems in graph theory.
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, The Journal of Chemical Physics 21
1953
Earlier work this paper cites.
M. Held and R. M. Karp, Journal of the Society for Industrial and Applied Mathematics 10
1962
Earlier work this paper cites.
J. D. C. Little, K. G. Murty, D. W. Sweeney, and C. Karel, Operations Research 11
1963
Earlier work this paper cites.
B. W. Kernighan and S. Lin, The Bell System Technical Journal 49
1970
Earlier work this paper cites.
J. A. Barker, The Journal of Chemical Physics 70
1979
Earlier work this paper cites.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley-Interscience Series in Discrete Mathematics, 1985)
1985
Earlier work this paper cites.
R. Dechter, Artificial Intelligence 41
1990
Earlier work this paper cites.
M. Grötschel, M. Jünger, and G. Reinelt, Zeitschrift für Operations Research 35
1991
Earlier work this paper cites.
M. Padberg and G. Rinaldi, SIAM Rev. 33
1991
Earlier work this paper cites.
L. K. Grover, in Proc. 28 th Annual ACM Symposium on Theory of Computing (STOC’96) (1996) pp. 212–219
1996
Cited alongside, same era.
C. Dürr and P. Høyer, “A quantum algorithm for finding the minimum,” (1996), arXiv:quant-ph/9607014
1996
Cited alongside, same era.
O. C. Martin and S. W. Otto, Annals of Operations Research 63
1996
Cited alongside, same era.
G. Brassard and P. Høyer, “An exact quantum polynomial-time algorithm for Simon’s problem,” (1997), arXiv:quant-ph/9704027
1997
Cited alongside, same era.
R. Martoňák, G. E. Santoro, and E. Tosatti, Phys. Rev. E 70
2004
Cited alongside, same era.
D. Eppstein, Journal of Graph Algorithms and Applications 11
2007
Cited alongside, same era.
2011
Later among the works it cites.
H. Chen, X. Kong, B. Chong, G. Qin, X. Zhou, X. Peng, and J. Du, Phys. Rev. A 83
2011
Later among the works it cites.
A. Belovs, “Quantum walks and electric networks,” (2013), arXiv:1302.3143
2013
Later among the works it cites.
A. Belovs, A. Childs, S. Jeffery, R. Kothari, and F. Magniez, in Proc. 40 th International Conference on Automata, Languages and Programming (ICALP’13) (2013) pp. 105–122
2013
Later among the works it cites.
M. Liśkiewicz and M. R. Schuster, Journal of Discrete Algorithms 27
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Iwama and T. Nakashima, in Proc. 13 th Annual International Computing and Combinatorics Conference (COCOON’07) (2007) pp. 108–117
2007
Cited alongside, same era.
S. Dörn, in Proc. CIE (2007) pp. 123–131
2007
Cited alongside, same era.
A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto, in Proc. 35 th International Conference on Automata, Languages and Programming (ICALP’08) (2008) pp. 198–209
2008
Cited alongside, same era.
M. Xiao and H. Nagamochi, Algorithmica 74
Cited in the paper.
M. Xiao and H. Nagamochi, Theory of Computing Systems 58
Cited in the paper.
A. Ambainis and M. Kokainis, “Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games,” (2016a), forthcoming
Cited in the paper.
A. Björklund, SIAM Journal on Computing 43
2014
Later among the works it cites.
H. L. Bodlaender, M. Cygan, S. Kratsch, and J. Nederlof, Information and Computation 243
2015
Later among the works it cites.
A. Montanaro, “Quantum walk speedup of backtracking algorithms,” (2015), arXiv:1509.02374
2015
Later among the works it cites.
S. Mandrà, G. G. Guerreschi, and A. Aspuru-Guzik, New Journal of Physics 18
2016
Closest in time.