Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid. On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. In Vijay Chandru, V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings. Volume 1180 of Lecture Notes in Computer Science, pages 64-75, Springer, 1996.
@inproceedings{DasKS96,
title = {On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees},
author = {Gautam Das and Sanjiv Kapoor and Michiel H. M. Smid},
year = {1996},
researchr = {https://researchr.org/publication/DasKS96},
cites = {0},
citedby = {0},
pages = {64-75},
booktitle = {Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings},
editor = {Vijay Chandru and V. Vinay},
volume = {1180},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-62034-6},
}