Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon)

Irit Dinur, Venkatesan Guruswami, Subhash Khot. Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon). Electronic Colloquium on Computational Complexity (ECCC), (027), 2002. [doi]

Authors

Irit Dinur

This author has not been identified. Look up 'Irit Dinur' in Google

Venkatesan Guruswami

This author has not been identified. Look up 'Venkatesan Guruswami' in Google

Subhash Khot

This author has not been identified. Look up 'Subhash Khot' in Google