Pages that link to "Item:Q1183467"
From MaRDI portal
The following pages link to Covering a set of points in multidimensional space (Q1183467):
Displaying 29 items.
- Covering moving points with anchored disks (Q421753) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Ectropy of diversity measures for populations in Euclidean space (Q545352) (← 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)
- A clustering-based approach to kinetic closest pair (Q722518) (← links)
- Minimal sensor integrity: Measuring the vulnerability of sensor grids (Q1007573) (← links)
- An improved algorithm for online unit clustering (Q1040649) (← links)
- How many intervals cover a point in Dvoretzky covering? (Q1852719) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- The most points connected-covering problem with two disks (Q2322704) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Covering a Euclidean line or hyperplane by dilations of its discretization (Q2405479) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- Selecting Heavily Covered Points (Q4327414) (← links)
- (Q4373440) (← links)
- COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS (Q4818599) (← links)
- Analysis of a first-fit algorithm for the capacitated unit covering problem (Q4976332) (← links)
- On capacitated covering with unit balls (Q5266149) (← links)
- ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← links)
- Covering Points by Unit Disks of Fixed Location (Q5387798) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Covering a set of points with a minimum number of equal disks via simulated annealing (Q6097195) (← links)
