Pages that link to "Item:Q3448847"
From MaRDI portal
The following pages link to A PTAS for the Weighted Unit Disk Cover Problem (Q3448847):
Displaying 18 items.
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Theoretical complexity of grid cover problems used in radar applications (Q1626552) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Constant-approximation for minimum weight partial sensor cover (Q5013505) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. (Q5874550) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5918633) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5925710) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
