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]

Abstract

Abstract is missing.