The within-strip discrete unit disk cover problem
From MaRDI portal
Publication:528480
Recommendations
- On the discrete unit disk cover problem
- On the discrete unit disk cover problem
- The Coverage Problem by Aligned Disks
- The coverage problem by aligned disks
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
- Capacitated discrete unit disk cover
- Capacitated discrete unit disk cover
- Approximation algorithms for the unit disk cover problem in 2D and 3D
- Algorithms for the line-constrained disk coverage and related problems
- Algorithms for the line-constrained disk coverage and related problems
Cites work
- scientific article; zbMATH DE number 1507300 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A PTAS for the Weighted Unit Disk Cover Problem
- A linear work, \(O(n^{1/6})\) time, parallel algorithm for solving planar Laplacians
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- A threshold of ln n for approximating set cover
- Almost optimal set covers in finite VC-dimension
- An improved line-separable algorithm for discrete unit disk cover
- Approximation and Online Algorithms
- Approximation schemes for covering and packing problems in image processing and VLSI
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Covering Points by Unit Disks of Fixed Location
- Covering a set of points in multidimensional space
- Exact and approximation algorithms for clustering
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Homogeneous 2-hop broadcast in 2D
- How to draw a planar graph on a grid
- Improved approximation algorithms for geometric set cover
- Improved results on geometric hitting set problems
- Linear time approximation for dominating sets and independent dominating sets in unit disk graphs
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- New existence proofs ε-nets
- On the discrete unit disk cover problem
- Optimal packing and covering in the plane are NP-complete
- PTAS for weighted set cover on unit squares
- Planar Formulae and Their Uses
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
- Simple heuristics for unit disk graphs
- Some APX-completeness results for cubic graphs
- The Location of Emergency Service Facilities
- The NP-completeness column: An ongoing guide
- The Rectilinear Steiner Tree Problem is NP-Complete
- The searching over separators strategy to solve some NP-hard problems in subexponential time
Cited in
(13)- Line segment disk cover
- Capacitated discrete unit disk cover
- Approximability and hardness of geometric hitting set with axis-parallel rectangles
- \(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point
- Discrete unit square cover problem
- Weighted geometric set cover with rectangles of bounded integer side lengths
- Geometric cover with outliers removal
- Covering and packing of triangles intersecting a straight line
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
- Approximation algorithms for minimum ply covering of points with unit squares and unit disks
- A constant-factor approximation algorithm for red-blue set cover with unit disks
- A constant-factor approximation algorithm for red-blue set cover with unit disks
- Discriminating code and set cover with k-bend paths
This page was built for publication: The within-strip discrete unit disk cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528480)
