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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Bläser, M., Panagiotou, K., & Rao, B. V. R. (2012). A probabilistic analysis of Christofides’ algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7357 LNCS, pp. 225–236). https://doi.org/10.1007/978-3-642-31155-0_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
