scientific article; zbMATH DE number 1436138

zbMATH Open0938.68876MaRDI QIDQ4948735FDOQ4948735

Authors: Joachim Gudmundsson, Christos Levcopoulos 

Publication date: 21 June 2000

Title of this publication is not available (Why is that?)

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 (12)

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

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)