Hitting sets when the VC-dimension is small

@article{Even2005HittingSW,
  title={Hitting sets when the VC-dimension is small},
  author={Guy Even and Dror Rawitz and Shimon Shahar},
  journal={Inf. Process. Lett.},
  year={2005},
  volume={95},
  pages={358-362}
}
We present an approximation algorithm for the hitting set problem when the VC-dimension of the set system is small. Our algorithm builds on Pach & Agarwal [7], and we show how it can be parallelized and extended to the minimum cost hitting set problem. The running time of the proposed algorithm is comparable with that of Brönnimann & Goodrich [2], and the approximation ratio is smaller by a constant factor. 

References

Publications referenced by this paper.
Showing 1-10 of 11 references

, and Éva Tardos . Fast approximation algorithms for fractional packing and covering problems

  • D. B. Shmoys Plotkin
  • Combinatorial Geometry
  • 1995

and Éva Tardos

  • S. A. Plotkin, D. B. Shmoys
  • Fast approximation algorithms for fractional…
  • 1995
2 Excerpts

Similar Papers

Loading similar papers…