scientific article; zbMATH DE number 1947392

MaRDI QIDQ4411358zbMATH OpenFDO

Authors Joachim Gudmundsson, A. Frank van der Stappen, Mark de Berg, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610187.htm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• TSP with neighborhoods of varying size
• Approximation algorithms for TSP with neighborhoods in the plane
• Approximation algorithms for TSP with neighborhoods in the plane
• A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane
• On Approximating the TSP with Intersecting Neighborhoods

Cited in

(7)

• Approximation algorithms for TSP with neighborhoods in the plane
• Constant-factor approximation for TSP with disks
• The travelling salesman problem with neighbourhoods: MINLP solution
• A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane
• On Approximating the TSP with Intersecting Neighborhoods
• TSP with neighborhoods of varying size
• On the complexity of approximating TSP with neighborhoods 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 Q4411358)