Approximation algorithms for spreading points

DOI10.1016/J.JALGOR.2004.06.009MaRDI QIDQ3445959zbMATH OpenOpenAlexFDO

Authors S. Cabello

Publication date 8 June 2007

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/23993

Mathematics Subject Classification ID

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

Recommendations

• Approximation and Online Algorithms
• Dispersion in disks
• Dispersion in unit disks
• Approximation algorithms for dispersion problems
• A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem

Cited in

(20)

• Approximation algorithms for aligning points
• Minimum color spanning circle of imprecise points
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Systems of distant representatives in Euclidean space
• Nearest-neighbor searching under uncertainty. I
• Minimum color spanning circle in imprecise setup
• Dispersion in unit disks
• Computing Maximally Separated Sets in the Plane
• Efficient approximations for the online dispersion problem
• On approximating point spread distributions
• Constrained \(k\)-center and movement to independence
• Approximation algorithms for aligning points
• Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
• Approximation and Online Algorithms
• Away from each other
• The dispersive art gallery problem
• Spreading points using gradient and tabu
• Algorithms for minimizing the movements of spreading points in linear domains
• Dispersion in disks
• A couple of simple algorithms for k-dispersion

This page was built for publication: Approximation algorithms for spreading points

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