Pages that link to "Item:Q483201"
From MaRDI portal
The following pages link to The computational complexity and approximability of a series of geometric covering problems (Q483201):
Displaying 8 items.
- Angle covers: algorithms and complexity (Q782165) (← links)
- The complexity of the covering radius problem (Q814418) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Covering a simplex by spheres: complexity and algorithms (Q2162517) (← links)
- (Q4474203) (← links)
- (Q4929402) (← links)
- (Q5009574) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)