Algorithms for the line-constrained disk coverage and related problems
From MaRDI portal
Publication:5896893
DOI10.1007/978-3-030-83508-8_42OpenAlexW3197259003MaRDI QIDQ5896893FDOQ5896893
Authors: Logan Pedersen, Haitao Wang 
Publication date: 25 March 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.14680
Recommendations
- Algorithms for the line-constrained disk coverage and related problems
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
- An improved line-separable algorithm for discrete unit disk cover
- The coverage problem by aligned disks
- The Coverage Problem by Aligned Disks
- Approximation algorithms for the unit disk cover problem in 2D and 3D
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
- The bound coverage problem by aligned disks in \(L_1\) metric
- On the discrete unit disk cover problem
- On the discrete unit disk cover problem
Cites Work
- A threshold of ln n for approximating set cover
- An improved line-separable algorithm for discrete unit disk cover
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Fast approximation algorithms for a nonconvex covering problem
- Computational geometry. Algorithms and applications.
- Algorithms for Reporting and Counting Geometric Intersections
- On the hardness of approximating minimization problems
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Weighted geometric set cover problems revisited
- Comments on “algorithms for reporting and counting geometric intersections”
- Polynomial time approximation schemes for base station coverage with minimum total radii
- Algorithms – ESA 2005
- Minimum-cost coverage of point sets by disks
- PTAS for geometric hitting set problems via local search
- Some variations on constrained minimum enclosing circle problem
- A PTAS for the Weighted Unit Disk Cover Problem
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- Faster algorithms for some optimization problems on collinear points
Cited In (6)
- Algorithms for the line-constrained disk coverage and related problems
- A note on minimum-sum coverage by aligned disks
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
- An optimal algorithm for the minimum disc cover problem
- The within-strip discrete unit disk cover problem
This page was built for publication: Algorithms for the line-constrained disk coverage and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896893)
