Algorithms for the line-constrained disk coverage and related problems
From MaRDI portal
Publication:5918695
DOI10.1016/j.comgeo.2022.101883zbMath1490.68268OpenAlexW3159910038WikidataQ114195519 ScholiaQ114195519MaRDI QIDQ5918695
Publication date: 13 June 2022
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101883
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- On synchronization and orientation in distributed barrier coverage with relocatable sensors
- Some variations on constrained minimum enclosing circle problem
- Complexity of barrier coverage with relocatable sensors in the plane
- Polynomial time approximation schemes for base station coverage with minimum total radii
- WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- Algorithms for Reporting and Counting Geometric Intersections
- A threshold of ln n for approximating set cover
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- A PTAS for the Weighted Unit Disk Cover Problem
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
- Fast approximation algorithms for a nonconvex covering problem
- Comments on “algorithms for reporting and counting geometric intersections”
- On the hardness of approximating minimization problems
- PTAS for geometric hitting set problems via local search
- Algorithms – ESA 2005
- Algorithms for covering multiple barriers
This page was built for publication: Algorithms for the line-constrained disk coverage and related problems
