Approximation of geometric dispersion problems
From MaRDI portal
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Recommendations
Cited in
(29)- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- Locating two facilities on a square with a minimum distance requirement
- Dispersion in disks
- A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
- Tiling with Squares and Packing Dominos in Polynomial Time
- A heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container
- Approximation algorithms for dispersion problems
- TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING
- Discrete representation of non-dominated sets in multi-objective linear programming
- Algorithms for k-dispersion for points in convex position in the plane
- Locating two facilities on a square with a minimum distance requirement
- Dispersion models for geometric sums
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- Systems of distant representatives in Euclidean space
- Heuristic and Special Case Algorithms for Dispersion Problems
- Maximizing the number of obnoxious facilities to locate within a bounded region
- Dispersion problem on a convex polygon
- Minimum covering with travel cost
- Dispersion in unit disks
- Efficient approximations for the online dispersion problem
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- On flipping the Fréchet distance
- The dispersive art gallery problem
- Maximization problems of balancing submodular relevance and supermodular diversity
- Repulsion-based p-dispersion with distance constraints in non-convex polygons
- An approximation algorithm for locating maximal disks within convex polygons
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- Techniques and results on approximation algorithms for packing circles
- Dispersing points on intervals
This page was built for publication: Approximation of geometric dispersion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945923)
