Highly Influenced

# 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} }

- Published 2005 in Inf. Process. Lett.
DOI:10.1016/j.ipl.2005.03.010

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.