Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- Algorithms and Computation
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Approximation algorithms for spreading points
- Approximation of geometric dispersion problems
- Constrained \(k\)-center and movement to independence
- Dispersion in unit disks
- Minimizing movement
- Systems of distant representatives
Cited in
(15)- Systems of distant representatives in Euclidean space
- Approximation algorithms for spreading points
- Away from each other
- Approximation and Online Algorithms
- The dispersive art gallery problem
- Maximizing the sum of radii of disjoint balls or disks
- Dispersion in unit disks
- Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
- Dispersion with a pinch of salt
- scientific article; zbMATH DE number 5346877 (Why is no real title available?)
- Efficient approximations for the online dispersion problem
- Minimum color spanning circle in imprecise setup
- Computing Maximally Separated Sets in the Plane
- Minimum color spanning circle of imprecise points
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)
