The rectilinear k-bends TSP

DOI10.1007/978-3-642-14031-0_30MaRDI QIDQ3578326zbMATH OpenOpenAlexWikidataFDO

Authors Apichat Heednacram, Francis Suraweera, Vladimir Estivill-Castro

Publication date 20 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14031-0_30

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• FPT-algorithms for minimum-bends tours
• Improved FPT Algorithms for Rectilinear k-Links Spanning Path
• scientific article; zbMATH DE number 1757971
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
• Is it FPT to cover points with tours on minimum number of bends (errata)?

Cited in

(4)

• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
• Is it FPT to cover points with tours on minimum number of bends (errata)?
• FPT-algorithms for minimum-bends tours
• scientific article; zbMATH DE number 1757971 (Why is no real title available?)

This page was built for publication: The rectilinear \(k\)-bends TSP

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