The within-strip discrete unit disk cover problem
From MaRDI portal
Publication:528480
DOI10.1016/J.TCS.2017.01.030zbMATH Open1370.68297OpenAlexW2592261725MaRDI QIDQ528480FDOQ528480
Alejandro Lopez-Ortiz, Robert Fraser
Publication date: 12 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.01.030
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- A threshold of ln n for approximating set cover
- A Greedy Heuristic for the Set-Covering Problem
- Some APX-completeness results for cubic graphs
- Almost optimal set covers in finite VC-dimension
- Title not available (Why is that?)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- New existence proofs ε-nets
- Planar Formulae and Their Uses
- ON THE DISCRETE UNIT DISK COVER PROBLEM
- Covering Points by Unit Disks of Fixed Location
- The Location of Emergency Service Facilities
- Improved results on geometric hitting set problems
- How to draw a planar graph on a grid
- Exact and approximation algorithms for clustering
- Approximation schemes for covering and packing problems in image processing and VLSI
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- 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
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Optimal packing and covering in the plane are NP-complete
- Simple heuristics for unit disk graphs
- PTAS for Weighted Set Cover on Unit Squares
- Improved approximation algorithms for geometric set cover
- Covering a set of points in multidimensional space
- Approximation and Online Algorithms
- Title not available (Why is that?)
- Homogeneous 2-hop broadcast in 2D
- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs
- A PTAS for the Weighted Unit Disk Cover Problem
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Cited In (11)
- 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
- 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
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)
