Algorithms for halfplane coverage and related problems
From MaRDI portal
Cites work
- A PTAS for the Weighted Unit Disk Cover Problem
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Algorithms for the line-constrained disk coverage and related problems
- An improved line-separable algorithm for discrete unit disk cover
- Approximating extent measures of points.
- Computing instance-optimal kernels in two dimensions
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Covering Points by Unit Disks of Fixed Location
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- Minimum membership covering and hitting
- Minimum ply covering of points with disks and squares
- Minimum-membership geometric set cover, revisited
- Near-linear algorithms for geometric hitting sets and set covers
- New lower bounds for Hopcroft's problem
- On a circle-cover minimization problem
- On the line-separable unit-disk coverage and related problems
- Optimal packing and covering in the plane are NP-complete
- PTAS for geometric hitting set problems via local search
- Practical methods for shape fitting and kinetic data structures using coresets
- Ray shooting in polygons using geodesic triangulations
- Settling the APX-hardness status for geometric set cover
- The discrete 2-center problem
- Unit-disk range searching and applications
- Visibility and intersection problems in plane geometry
- Weighted geometric set cover problems revisited
Cited in
(3)
This page was built for publication: Algorithms for halfplane coverage and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895818)
