Pages that link to "Item:Q3078392"
From MaRDI portal
The following pages link to On the Discrete Unit Disk Cover Problem (Q3078392):
Displaying 19 items.
- Following a curve with the discrete Fréchet distance (Q300222) (← links)
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- Two optimization problems for unit disks (Q1615636) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Approximation algorithm for sweep coverage on graph (Q2346569) (← links)
- Solving energy issues for sweep coverage in wireless sensor networks (Q2357168) (← links)
- A note on minimum-sum coverage by aligned disks (Q2445326) (← links)
- Discretely Following a Curve (Q2867104) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm (Q3652190) (← links)
- A constant-factor approximation for multi-covering with disks (Q5174484) (← 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)
- On the geometric priority set cover problem (Q6103173) (← links)
