Pages that link to "Item:Q1931286"
From MaRDI portal
The following pages link to A note on multicovering with disks (Q1931286):
Displaying 17 items.
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- On the multi-radius cover problem (Q845720) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- A note on minimum-sum coverage by aligned disks (Q2445326) (← links)
- A PTAS for the disk cover problem of geometric objects (Q2450711) (← links)
- Polynomial time approximation schemes for base station coverage with minimum total radii (Q2484959) (← links)
- Fault-tolerant covering problems in metric spaces (Q2659766) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626) (← links)
- A constant-factor approximation for multi-covering with disks (Q2970422) (← links)
- A constant-factor approximation for multi-covering with disks (Q5174484) (← links)
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344) (← links)
- PTAS for minimum cost multicovering with disks (Q6593767) (← links)
