1. On a theorem of Lovász on covers in r-partite hypergraphs;Aharoni;Combinatorica,1996
2. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora,1995
3. Inapproximability of vertex cover and independent set in bounded degree graphs;Austrin,2009
4. Inapproximability of hypergraph vertex cover and applications to scheduling problems;Bansal,2010
5. Approximating the dense set-cover problem;Bar-Yehuda;J. Comput. Syst. Sci.,2004