On line-separable weighted unit-disk coverage and related problems
From MaRDI portal
Cites work
- A PTAS for the Weighted Unit Disk Cover Problem
- Algorithms – ESA 2005
- Algorithms for halfplane coverage and related problems
- Algorithms for the line-constrained disk coverage and related problems
- An improved line-separable algorithm for discrete unit disk cover
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Cutting hyperplanes for divide-and-conquer
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Faster algorithms for some optimization problems on collinear points
- Faster approximation algorithms for geometric set cover
- Geometric hitting set for line-constrained disks
- Improved results on geometric hitting set problems
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- Minimum-cost coverage of point sets by disks
- Near-linear algorithms for geometric hitting sets and set covers
- On the line-separable unit-disk coverage and related problems
- Polynomial time approximation schemes for base station coverage with minimum total radii
- Practical and efficient algorithms for the geometric hitting set problem
- Some variations on constrained minimum enclosing circle problem
- Unit-disk range searching and applications
- Weighted geometric set cover problems revisited
This page was built for publication: On line-separable weighted unit-disk coverage and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964865)
