Polynomial time approximation schemes for Euclidean TSP and other geometric problems
- 24 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of 37th Conference on Foundations of Computer Science
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Approximating clique is almost NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A proof of the Gilbert-Pollak conjecture on the Steiner ratioAlgorithmica, 1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Some NP-complete geometric problemsPublished by Association for Computing Machinery (ACM) ,1976
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965