Pages that link to "Item:Q3776651"
From MaRDI portal
The following pages link to Fast approximation algorithms for a nonconvex covering problem (Q3776651):
Displayed 23 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- Location, pricing and the problem of Apollonius (Q1686568) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Unique Covering Problems with Geometric Sets (Q3196414) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Geometric Hitting Sets for Disks: Theory and Practice (Q3452850) (← links)
- (Q5091070) (← links)
- (Q5115816) (← 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)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
- On point covers of \(c-\)oriented polygons (Q5941498) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)