THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE
From MaRDI portal
Publication:4903631
DOI10.1142/S1793830912500449zbMath1259.68236arXiv1204.5828MaRDI QIDQ4903631
Publication date: 24 January 2013
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.5828
linear programmingapproximation algorithmlinesraystraveling salesman problem with neighborhoodsminimum-perimeter rectangle
Related Items
The touring rays and related problems ⋮ Polynomial-time algorithms for the touring rays and related problems
Cites Work
- Approximation algorithms for the Geometric Covering Salesman Problem
- The traveling salesmanpProblem for lines in the plane
- Fast computation of shortest watchman routes in simple polygons
- Finding the shortest watchman route in a simple polygon
- Minimum-perimeter intersecting polygons
- Linear Programming in Linear Time When the Dimension Is Fixed
- Approximation algorithms for TSP with neighborhoods in the plane
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"