Pages that link to "Item:Q2291457"
From MaRDI portal
The following pages link to Near-linear algorithms for geometric hitting sets and set covers (Q2291457):
Displaying 17 items.
- Improved results on geometric hitting set problems (Q603882) (← links)
- Improved approximation algorithms for geometric set cover (Q866970) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← 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)
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551) (← links)
- Geometric Set Cover and Hitting Sets for Polytopes in R (Q4910744) (← links)
- Improved approximation algorithms for geometric set cover (Q5370605) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Subtrajectory clustering: finding set covers for set systems of subcurves (Q5881551) (← links)
- Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\) (Q6190006) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
- On the line-separable unit-disk coverage and related problems (Q6600812) (← links)
- Online geometric covering and piercing (Q6614105) (← links)
