1. Rounding algorithms for covering problems;Bertsimas;Mathematical Programming,1998
2. R.D. Carr, L.K. Fleischer, V.J. Leung, C.A. Phillips, Strengthening integrality gaps for capacitated network design and covering problems, in: Proceedings of the Eleventh Annual ACM–SIAM Symposium on Discrete Algorithms (SODA-2000), 2000, pp. 106–115
3. A new multilayered PCP and the hardness of hypergraph vertex cover;Dinur;SIAM Journal on Computing,2005
4. On the hardness of approximating minimum vertex cover;Dinur;Annals of Mathematics,2005
5. Worst-case analysis of greedy heuristics for integer programming with nonnegative data;Dobson;Mathematics of Operations Research,1982