FPT-algorithms for minimum-bends tours
DOI10.1142/S0218195911003615zbMATH Open1215.65037WikidataQ58803139 ScholiaQ58803139MaRDI QIDQ2999094FDOQ2999094
Authors: Apichat Heednacram, Francis Suraweera, Vladimir Estivill-Castro 
Publication date: 11 May 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- The traveling salesman problem. A computational study.
- The Euclidean traveling salesman problem is NP-complete
- Rectilinear paths among rectilinear obstacles
- Covering things with things
- On the complexity of locating linear facilities in the plane
- Minimum-link watchman tours
- Optimal Covering Tours with Turn Costs
- COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
- Traversing a set of points with a minimum number of turns
- The exact fitting problem in higher dimensions
Cited In (7)
- Is it FPT to cover points with tours on minimum number of bends (errata)?
- The rectilinear \(k\)-bends TSP
- Title not available (Why is that?)
- On Covering Points with Minimum Turns
- Parameterized analysis and crossing minimization problems
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
- On covering points with minimum turns
This page was built for publication: FPT-algorithms for minimum-bends tours
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999094)
