Dispersion in disks
From MaRDI portal
Publication:693055
DOI10.1007/S00224-011-9331-XzbMATH Open1435.68383OpenAlexW2056078401MaRDI QIDQ693055FDOQ693055
Authors: Adrian Dumitrescu, Minghui 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
Recommendations
Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Minimizing movement
- Systems of distant representatives
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Algorithms and Computation
- Approximation of geometric dispersion problems
- Dispersion in unit disks
- Approximation algorithms for spreading points
- Constrained \(k\)-center and movement to independence
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
Cited In (15)
- Approximation and Online Algorithms
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
- Efficient Approximations for the Online Dispersion Problem
- Systems of distant representatives in Euclidean space
- Away from each other
- Computing Maximally Separated Sets in the Plane
- Maximizing the sum of radii of disjoint balls or disks
- Dispersion with a pinch of salt
- Minimum color spanning circle of imprecise points
- Dispersion in unit disks
- Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks
- Approximation algorithms for spreading points
- The dispersive art gallery problem
- Title not available (Why is that?)
- Minimum color spanning circle in imprecise setup
This page was built for publication: Dispersion in disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693055)
