Pages that link to "Item:Q5404461"
From MaRDI portal
The following pages link to Tight lower bounds for the size of epsilon-nets (Q5404461):
Displaying 11 items.
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Small strong epsilon nets (Q396471) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- The class cover problem with boxes (Q419500) (← links)
- Piercing quasi-rectangles-on a problem of Danzer and Rogers (Q439049) (← links)
- Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- (Q5088989) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
