Pages that link to "Item:Q5434450"
From MaRDI portal
The following pages link to An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem (Q5434450):
Displaying 8 items.
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm (Q3652190) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)