The Traveling Salesman Problem under squared Euclidean distances
DOI10.4230/LIPICS.STACS.2010.2458zbMath1230.68217OpenAlexW1570186883MaRDI QIDQ3113753
Fred van Nijnatten, Gerhard J. Woeginger, Alexander Wolff, Mark T. de Berg, R. A. Sitters
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_adc8.html
NP-hardAPX-hardgeometric traveling salesman problemdistance-power gradientpower-assignment in wireless networks
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: The Traveling Salesman Problem under squared Euclidean distances
