The traveling salesman problem for lines, balls and planes

DOI10.1137/1.9781611973105.59MaRDI QIDQ5741767zbMATH OpenOpenAlexFDO

Authors Adrian Dumitrescu, Csaba D. Tóth

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.59

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• The traveling salesman problem for lines, balls, and planes
• Approximation algorithms for TSP with neighborhoods in the plane
• Approximation algorithms for TSP with neighborhoods in the plane
• The traveling salesman problem for lines and rays in the plane
• Constant-factor approximation for TSP with disks

Cited in

(5)

• The Convex-hull-and-k-line Travelling Salesman Problem
• The traveling salesmanpProblem for lines in the plane
• Building bridges between convex regions
• The traveling salesman problem for lines and rays in the plane
• The traveling salesman problem for lines, balls, and planes

This page was built for publication: The traveling salesman problem for lines, balls and planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741767)