Publication:4948735
From MaRDI portal
zbMath0938.68876MaRDI QIDQ4948735
Joachim Gudmundsson, Christos Levcopoulos
Publication date: 21 June 2000
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Constant-Factor Approximation for TSP with Disks, Facility location problems on graphs with non-convex neighborhoods, 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, Cooperative TSP, Bi-objective data gathering path planning for vehicles with bounded curvature, Minimum cost \(b\)-matching problems with neighborhoods, Connectivity graphs of uncertainty regions, The Shortest Separating Cycle Problem, Approximation Algorithms for Generalized MST and TSP in Grid Clusters