scientific article; zbMATH DE number 1757971

MaRDI QIDQ4537759zbMATH OpenFDO

Authors David P. Wagner, Clifford Stein

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810406

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• FPT-algorithms for minimum-bends tours
• The Angular-Metric Traveling Salesman Problem
• TRAVELING SALESMAN PROBLEM OF SEGMENTS
• The rectilinear \(k\)-bends TSP
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Cited in

(14)

• Covering paths for planar point sets
• Optimal covering tours with turn costs
• Is it FPT to cover points with tours on minimum number of bends (errata)?
• FPT-algorithms for minimum-bends tours
• The rectilinear \(k\)-bends TSP
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
• The Angular-Metric Traveling Salesman Problem
• Traversing a set of points with a minimum number of turns
• What goes around comes around: covering tours and cycle covers with turn costs
• The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
• Noncrossing longest paths and cycles
• Noncrossing longest paths and cycles
• An improved bound for plane covering paths
• On the approximability of covering points by lines and related problems

This page was built for publication:

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