The Traveling Salesman Problem for Lines, Balls, and Planes
DOI10.1145/2850418zbMath1423.90220arXiv1303.6659OpenAlexW1870153077MaRDI QIDQ4962619
Adrian Dumitrescu, Csaba D. Tóth
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.6659
linear programmingtraveling salesmanapproximation algorithmhyperplanesgroup Steiner treeunit disksunit ballsminimum-perimeter rectangular box
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
This page was built for publication: The Traveling Salesman Problem for Lines, Balls, and Planes