Pages that link to "Item:Q5370695"
From MaRDI portal
The following pages link to PTAS for geometric hitting set problems via local search (Q5370695):
Displayed 20 items.
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- The matroid intersection cover problem (Q2661583) (← links)
- Unique Covering Problems with Geometric Sets (Q3196414) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Guarding 1.5D terrains with demands (Q4902836) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
- Capacitated discrete unit disk cover (Q5918931) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Geometric hitting set for line-constrained disks (Q6139038) (← links)