Approximation algorithms for the TSP with sharpened triangle inequality
- 15 August 2000
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 75 (3) , 133-138
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle InequalitiesSIAM Journal on Discrete Mathematics, 1995
- The Traveling Salesman Problem with Distances One and TwoMathematics of Operations Research, 1993
- Faster scaling algorithms for general graph matching problemsJournal of the ACM, 1991