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

Cites work

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

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)