Geometric covering via extraction theorem
From MaRDI portal
Cites work
- A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- A better constant-factor approximation for weighted dominating set in unit disk graph
- A PTAS for the Weighted Unit Disk Cover Problem
- Almost optimal set covers in finite VC-dimension
- Approximation algorithms for maximum independent set of pseudo-disks
- Approximation Schemes for Covering and Packing
- Approximation schemes for covering and packing problems in image processing and VLSI
- Approximation schemes for maximum weight independent set of rectangles
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Constructing planar support for non-piercing regions
- Coverage for robotics -- a survey of recent results
- Covering algorithms, continuum percolation and the geometry of wireless networks
- Differential approximation algorithms for some combinatorial optimization problems
- Geometric Packing under Nonuniform Constraints
- Hitting sets when the VC-dimension is small
- scientific article; zbMATH DE number 1256776 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 7378687 (Why is no real title available?)
- Improved approximation algorithms for geometric set cover
- Improved local search for geometric hitting set
- Improved results on geometric hitting set problems
- Maximizing a monotone submodular function subject to a matroid constraint
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- On the differential approximation of MIN SET COVER
- Optimal packing and covering in the plane are NP-complete
- Packing and covering with non-piercing regions
- Plane hop spanners for unit disk graphs: simpler and better
- PTAS for weighted set cover on unit squares
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Weighted geometric set cover via quasi-uniform sampling
Cited in
(1)
This page was built for publication: Geometric covering via extraction theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906433)
