A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
From MaRDI portal
Publication:6556166
DOI10.1016/J.ORL.2023.07.005MaRDI QIDQ6556166
Publication date: 17 June 2024
Published in: Operations Research Letters (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new upper bound for the VC-dimension of visibility regions
- Improved approximation for guarding simple galleries from the perimeter
- Guarding galleries and terrains
- Improved approximation algorithms for geometric set cover
- Approximation algorithms for art gallery problems in polygons
- 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
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Guarding galleries where no point sees a small area.
- Separation and approximation of polyhedral objects
- Almost optimal set covers in finite VC-dimension
- Fast vertex guarding for polygons with and without holes
- Near-linear algorithms for geometric hitting sets and set covers
- Finding a guard that sees most and a shop that sells most
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Approximation schemes for covering and packing problems in image processing and VLSI
- A Greedy Heuristic for the Set-Covering Problem
- Lectures on Polytopes
- Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Algorithms for polytope covering and approximation
- Epsilon nets and union complexity
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
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)
