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]
@inproceedings{EngebretsenK01,
title = {Approximation Hardness of TSP with Bounded Metrics},
author = {Lars Engebretsen and Marek Karpinski},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2076/20760201.htm},
researchr = {https://researchr.org/publication/EngebretsenK01},
cites = {0},
citedby = {0},
pages = {201-212},
booktitle = {Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings},
editor = {Fernando Orejas and Paul G. Spirakis and Jan van Leeuwen},
volume = {2076},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42287-0},
}