An approximation algorithm for the maximum traveling salesman problem
- 17 August 1998
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 67 (3), 125-130
- https://doi.org/10.1016/s0020-0190(98)00102-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An approximation algorithm for maximum packing of 3-edge pathsInformation Processing Letters, 1997
- Two Algorithmic Results for the Traveling Salesman ProblemMathematics of Operations Research, 1996
- Maximizing traveling salesman problem for special matricesDiscrete Applied Mathematics, 1995
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian CircuitOperations Research, 1979
- An Analysis of the Greedy Heuristic for Independence SystemsAnnals of Discrete Mathematics, 1978