A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem

DOI10.1007/11809678_19MaRDI QIDQ3591350zbMATH OpenOpenAlexFDO

Authors Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://publikationen.bibliothek.kit.edu/1000005162

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Continuous location (90B85)

Recommendations

• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
• Approximation of geometric dispersion problems
• Packing two disks into a polygonal environment.
• scientific article; zbMATH DE number 1182762
• scientific article; zbMATH DE number 1796962

Cited in

(14)

• Intractability of assembly sequencing: unit disks in the plane
• Approximation and Online Algorithms
• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
• Dispersion in disks
• Packing two disks into a polygonal environment.
• scientific article; zbMATH DE number 824099 (Why is no real title available?)
• Approximation of geometric dispersion problems
• Dispersion in unit disks
• Placing your coins on a shelf
• Approximation algorithms for spreading points
• Placing your coins on a shelf
• Repulsion-based p-dispersion with distance constraints in non-convex polygons
• An approximation algorithm for locating maximal disks within convex polygons
• scientific article; zbMATH DE number 1796962 (Why is no real title available?)

This page was built for publication: A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem

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