Approximation Hardness of TSP with Bounded Metrics

Lars Engebretsen, Marek Karpinski. Approximation Hardness of TSP with Bounded Metrics. In Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen, editors, Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings. Volume 2076 of Lecture Notes in Computer Science, pages 201-212, Springer, 2001. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.