An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- 28 December 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 44 (6) , 297-302
- https://doi.org/10.1016/0020-0190(92)90103-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Optimal covering of cacti by vertex-disjoint pathsTheoretical Computer Science, 1991
- Approximation algorithms for covering a graph by vertex‐disjoint paths of maximum total weightNetworks, 1990
- On mapping processes to processors in distributed systemsInternational Journal of Parallel Programming, 1987
- On the worst‐case performance of some algorithms for the asymmetric traveling salesman problemNetworks, 1982
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman ProblemSIAM Journal on Computing, 1979
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code OptimizationJournal of the ACM, 1977