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):
Displayed 5 items.
- On the geometric set multicover problem (Q2167317) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- (Q5881551) (← links)
- Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\) (Q6190006) (← links)