Analysis of Christofides' heuristic: Some paths are more difficult than cycles
- 1 July 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (5), 291-295
- https://doi.org/10.1016/0167-6377(91)90016-i
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Tight bounds for christofides' traveling salesman heuristicMathematical Programming, 1978
- P-Complete Approximation ProblemsJournal of the ACM, 1976