scientific article; zbMATH DE number 1436138

MaRDI QIDQ4948735zbMATH OpenFDO

Authors Joachim Gudmundsson, Christos Levcopoulos

Publication date 21 June 2000

zbMATH Keywords

TSP with neighborhoodsred-blue separation

Mathematics Subject Classification ID

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

Cited in

(11)

• Cooperative TSP
• Bi-objective data gathering path planning for vehicles with bounded curvature
• Minimum cost \(b\)-matching problems with neighborhoods
• Observation routes and external watchman routes
• Approximation algorithms for generalized MST and TSP in grid clusters
• The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
• Constant-factor approximation for TSP with disks
• The shortest separating cycle problem
• Facility location problems on graphs with non-convex neighborhoods
• Observation routes and external watchman routes
• A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics

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 Q4948735)