Pages that link to "Item:Q1707909"
From MaRDI portal
The following pages link to Practical and efficient algorithms for the geometric hitting set problem (Q1707909):
Displaying 10 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551) (← links)
- Bounded-degree plane geometric spanners in practice (Q6579765) (← links)
- On the line-separable unit-disk coverage and related problems (Q6600812) (← links)