An exact algorithm for a class of geometric set-cover problems
From MaRDI portal
Publication:2030243
DOI10.1016/j.dam.2021.05.005zbMath1469.90121OpenAlexW3163918205MaRDI QIDQ2030243
Publication date: 7 June 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.005
Cites Work
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Unit disk cover problem in 2D
- Improved results on geometric hitting set problems
- Approximation algorithms for the unit disk cover problem in 2D and 3D
- A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
- Optimal packing and covering in the plane are NP-complete
- A scalable exact algorithm for the vertex \(p\)-center problem
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Approximation schemes for covering and packing problems in image processing and VLSI
- The Continuous-Time Service Network Design Problem
- ON THE DISCRETE UNIT DISK COVER PROBLEM
- Covering Points by Unit Disks of Fixed Location
- Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
