The coverage problem by aligned disks
From MaRDI portal
Publication:2695288
DOI10.1007/978-3-030-89543-3_19OpenAlexW3211312615MaRDI QIDQ2695288
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_19
Related Items
Cites Work
- Efficient algorithms for the one-dimensional \(k\)-center problem
- New algorithms for facility location problems on the real line
- Improved complexity bounds for location problems on the real line
- Some variations on constrained minimum enclosing circle problem
- A note on minimum-sum coverage by aligned disks
- Polynomial time approximation schemes for base station coverage with minimum total radii
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
- THE ALIGNED K-CENTER PROBLEM
- On the Complexity of Some Common Geometric Location Problems
- New Results on the Complexity of p-Centre Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item