Dispersion in disks

DOI10.1007/s00224-011-9331-xzbMath1435.68383OpenAlexW2056078401MaRDI QIDQ693055

Adrian Dumitrescu, Ming-Hui Jiang

Publication date: 7 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9331-x

zbMATH Keywords

linear programmingapproximation algorithmdispersion problem

Mathematics Subject Classification ID

Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items

Minimum color spanning circle of imprecise points, Away from each other, The dispersive art gallery problem, A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares, Minimum color spanning circle in imprecise setup, Efficient Approximations for the Online Dispersion Problem, Systems of distant representatives in Euclidean space

Cites Work

• Constrained \(k\)-center and movement to independence
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Systems of distant representatives
• Minimizing movement
• Dispersion in unit disks
• Approximation algorithms for spreading points
• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
• Algorithms and Computation
• Approximation of geometric dispersion problems
• Unnamed Item