Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 2012: Algorithm Theory – SWAT 2012 pp 225–236Cite as

A Probabilistic Analysis of Christofides’ Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7357))

Abstract

Christofides’ algorithm is a well known approximation algorithm for the metric travelling salesman problem. As a first step towards obtaining an average case analysis of Christofides’ algorithm, we provide a probabilistic analysis for the stochastic version of the algorithm for the Euclidean traveling salesman problem, where the input consists of n randomly chosen points in [0,1]d. Our main result provides bounds for the length of the computed tour that hold almost surely. We also provide an experimental evaluation of Christofides’s algorithm.

This project is partially funded by the DFG grant BL 511/7-1. The work was performed while the second author was affiliated with Max Planck Institute for Informatics in Saarbrücken.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Avis, D., Davis, B., Steele, J.M.: Probabilistic analysis of a greedy heuristic for euclidean matching. Probability in the Engineering and Informational Sciences 2(02), 143–156 (1988)

    Article  MATH  Google Scholar 

  3. Baltz, A., Dubhashi, D.P., Srivastav, A., Tansini, L., Werth, S.: Probabilistic analysis for a multiple depot vehicle routing problem. Random Struct. Algorithms 30(1-2), 206–225 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Proc. Cambridge Philos. Soc. 55, 299–327 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bertsimas, D.J., van Ryzin, G.: An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability. Operations Research Letters 9(4), 223–231 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University (1976)

    Google Scholar 

  7. Deineko, V., Tiskin, A.: Fast minimum-weight double-tree shortcutting for metric tsp: Is the best one good enough? J. Exp. Algorithmics 14, 4.6–4.16 (2010)

    Google Scholar 

  8. Frieze, A.M., Yukich, J.E.: Probabilistic analysis of the traveling salesman problem. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations, pp. 257–308. Kluwer Academic Publisher (2002)

    Google Scholar 

  9. Goemans, M.X., Bertsimas, D.J.: Probabilistic analysis of the held and karp lower bound for the euclidean traveling salesman problem. Mathematics of Operations Research 16(1), 72–89 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gutin, G., Punnen, A.P. (eds.): The traveling salesman problem and its variations. Combinatorial Optimization, vol. 12. Kluwer Academic Publishers (2002)

    Google Scholar 

  11. Johnson, D.S., McGeoch, L.A., Rothberg, E.E.: Asymptotic experimental analysis for the held-karp traveling salesman bound. In: SODA 1996, pp. 341–350 (1996)

    Google Scholar 

  12. Karp, R.M.: Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math. of Operat. Research 2(3), 209–224 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mitchell, J.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28(4), 1298–1309 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  14. Rhee, W.T.: On the travelling salesperson problem in many dimensions. Random Struct. Algorithms 3(3), 227–234 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Rhee, W.T.: A matching problem and subadditive euclidean functionals. Ann. Appl. Probab. 3(3), 794–801 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  16. Steele, J.M.: Subadditive Euclidean functionals and nonlinear growth in geometric probability. Ann. Probab. 9(3), 365–376 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  17. Steele, J.M.: Growth rates of Euclidean minimal spanning trees with power weighted edges. Ann. Probab. 16, 1767–1787 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  18. Steele, J.M.: Probability Theory and Combinatorial Optimization. CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 69. SIAM (1997)

    Google Scholar 

  19. Yukich, J.E.: Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Mathematics, vol. 1675. Springer (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Saarland University, Germany

    Markus Bläser & B. V. Raghavendra Rao

  2. Department of Mathematics, University of Munich, Germany

    Konstatinos Panagiotou

Authors
  1. Markus Bläser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstatinos Panagiotou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. V. Raghavendra Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Fedor V. Fomin

  2. Department of Information and Computer Science, Aalto University, PO Box 15400, 00076, Aalto, Finland

    Petteri Kaski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bläser, M., Panagiotou, K., Rao, B.V.R. (2012). A Probabilistic Analysis of Christofides’ Algorithm. In: Fomin, F.V., Kaski, P. (eds) Algorithm Theory – SWAT 2012. SWAT 2012. Lecture Notes in Computer Science, vol 7357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31155-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31155-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31154-3

  • Online ISBN: 978-3-642-31155-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation