Approximation of geometric dispersion problems
From MaRDI portal
Publication:5945923
DOI10.1007/s00453-001-0022-xzbMath0986.65010OpenAlexW2174353807MaRDI QIDQ5945923
Publication date: 9 January 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0022-x
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items (19)
An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs ⋮ A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM ⋮ Tiling with Squares and Packing Dominos in Polynomial Time ⋮ The dispersive art gallery problem ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Algorithms for \(k\)-dispersion for points in convex position in the plane ⋮ Connecting a set of circles with minimum sum of radii ⋮ Dispersing points on intervals ⋮ Minimum covering with travel cost ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ Dispersion in disks ⋮ TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING ⋮ Maximizing the number of obnoxious facilities to locate within a bounded region ⋮ Maximization problems of balancing submodular relevance and supermodular diversity ⋮ Repulsion-based p-dispersion with distance constraints in non-convex polygons ⋮ Techniques and results on approximation algorithms for packing circles ⋮ Systems of distant representatives in Euclidean space
This page was built for publication: Approximation of geometric dispersion problems
