Abstract
A tour in a graph is a connected walk that visits every vertex at least once, and returns to the starting vertex. Vishnoi (2012) proved that every connected d-regular graph with n vertices has a tour of length at most (1 + o(1))n, where the o(1) term (slowly) tends to 0 as d grows. His proof is based on van-der-Warden’s conjecture (proved independently by Egorychev (1981) and by Falikman (1981)) regarding the permanent of doubly stochastic matrices. We provide an exponential improvement in the rate of decrease of the o(1) term (thus increasing the range of d for which the upper bound on the tour length is nontrivial). Our proof does not use the van-der-Warden conjecture, and instead is related to the linear arboricity conjecture of Akiyama, Exoo and Harary (1981), or alternatively, to a conjecture of Magnant and Martin (2009) regarding the path cover number of regular graphs. More generally, for arbitrary connected graphs, our techniques provide an upper bound on the minimum tour length, expressed as a function of their maximum, average, and minimum degrees. Our bound is best possible up to a term that tends to 0 as the minimum degree grows.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs IV: linear arboricity. Networks 11, 69–72 (1981)
Alon, N.: Problems and results in extremal combinatorics, Part I. Discrete Math. 273, 31–53 (2003)
Alon, N., Spencer, J.: The Probabilistic Method. John Wiley and Sons (2004)
Alon, N., Teague, V.J., Wormald, N.C.: Linear arboricity and linear k-arboricity of regular graphs. Graphs and Combinatorics 17, 11–16 (2001)
Boyd, S., Sitters, R., van der Ster, S., Stougie, L.: TSP on cubic and subcubic graphs. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 65–77. Springer, Heidelberg (2011)
Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University (1976)
Correa, J.R., Larré, O., Soto, J.A.: TSP tours in cubic graphs: beyond 4/3. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 790–801. Springer, Heidelberg (2012)
Egorychev, G.P.: The solution of Van der Waerden’s problem for permanents. Advances in Mathematics 42(3), 299–305 (1981)
Falikman, D.I.: Proof of the Van der Waerden conjecture regarding the permanent of a doubly stochastic matrix. Mathematical Notes 29(6), 475–479 (1981)
Franzblau, D.S., Raychaudhuri, A.: Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow. ANZIAM Journal 44(2), 193–204 (2002)
Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4), 671–697 (2004)
Karp, J., Ravi, R.: A 9/7-Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs. arXiv:1311.3640 (November 2013)
Magnant, C., Martin, D.M.: A note on the path cover number of regular graphs. Australasian Journal of Combinatorics 43, 211–217 (2009)
Mömke, T., Svensson, O.: Approximating graphic TSP by matchings. In: Proceedings of Foundations of Computer Science (FOCS), pp. 560–569 (2011)
Moon, J.W.: On the diameter of a graph. The Michigan Mathematical Journal 12(3), 349–351 (1965)
Moser, R.A., Tardos, G.: A constructive proof of the general Lovász local lemma. J. ACM 57(2) (2010)
Saberi, A., Gharan, S.O., Singh, M.: A randomized rounding approach to the traveling salesman problem. In: Proceedings of Foundations of Computer Science (FOCS), pp. 550–559 (2011)
Sebö, A., Vygen, J.: Shorter Tours by Nicer Ears. CoRR, abs/1201.1870 (2012)
Vishnoi, N.K.: A Permanent Approach to the Traveling Salesman Problem. In: Proceedings of Foundations of Computer Science (FOCS), pp. 76–80 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Feige, U., Ravi, R., Singh, M. (2014). Short Tours through Large Linear Forests. In: Lee, J., Vygen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2014. Lecture Notes in Computer Science, vol 8494. Springer, Cham. https://doi.org/10.1007/978-3-319-07557-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-07557-0_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07556-3
Online ISBN: 978-3-319-07557-0
eBook Packages: Computer ScienceComputer Science (R0)