A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces

Cites Work

On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
A combinatorial problem; stability and order for models and theories in infinitary languages
On the density of families of sets
Approximation algorithms for combinatorial problems
A Greedy Heuristic for the Set-Covering Problem
Lectures on Polytopes
Hitting sets when the VC-dimension is small
\(\epsilon\)-nets and simplex range queries
Almost tight bounds for \(\epsilon\)-nets
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
On the ratio of optimal integral and fractional covers
Almost optimal set covers in finite VC-dimension
Title not available (Why is that?)
Title not available (Why is that?)
Epsilon nets and union complexity
Title not available (Why is that?)
Approximation algorithms for art gallery problems in polygons
Separation and approximation of polyhedral objects
The multiplicative weights update method: a meta-algorithm and applications
Approximation schemes for covering and packing problems in image processing and VLSI
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
Algorithms for polytope covering and approximation
Small-size \(\varepsilon\)-nets for axis-parallel rectangles and boxes
Guarding galleries and terrains
Title not available (Why is that?)
Finding a guard that sees most and a shop that sells most
Guarding galleries where no point sees a small area.
A new upper bound for the VC-dimension of visibility regions
Improved approximation for guarding simple galleries from the perimeter
Improved approximation algorithms for geometric set cover
Title not available (Why is that?)
Near-linear algorithms for geometric hitting sets and set covers
Title not available (Why is that?)
Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension
Fast vertex guarding for polygons with and without holes

This page was built for publication: A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556166)