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