@InProceedings{vannijnatten_et_al:LIPIcs.STACS.2010.2458,
author = {van Nijnatten, Fred and Sitters, Ren\'{e} and Woeginger, Gerhard J. and Wolff, Alexander and de Berg, Mark},
title = {{The Traveling Salesman Problem under Squared Euclidean Distances}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {239--250},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-16-3},
ISSN = {1868-8969},
year = {2010},
volume = {5},
editor = {Marion, Jean-Yves and Schwentick, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2458},
URN = {urn:nbn:de:0030-drops-24580},
doi = {10.4230/LIPIcs.STACS.2010.2458},
annote = {Keywords: Geometric traveling salesman problem, power-assignment in wireless networks, distance-power gradient, NP-hard, APX-hard}
}