Pages that link to "Item:Q2429345"
From MaRDI portal
The following pages link to Near-linear approximation algorithms for geometric hitting sets (Q2429345):
Displaying 19 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Minimum membership hitting sets of axis parallel segments (Q1791030) (← links)
- On separating points by lines (Q1985301) (← links)
- Covering problem on fuzzy graphs and its application in disaster management system (Q2157042) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909) (← links)
- Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension (Q4580115) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551) (← links)
- (Q5290249) (← links)
