Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Vertex cover might be hard to approximate to within 2-epsilonSubhash Khot, Oded Regev. jcss, 74(3):335-349, 2008. [doi] Vertex Cover Might be Hard to Approximate to within 2-/varepsilonSubhash Khot, Oded Regev. cocoon 2003: 379 [doi] On the Inapproximability of Vertex Cover on ::::k::::-Partite ::::k::::-Uniform HypergraphsVenkatesan Guruswami, Rishi Saket. icalp 2010: 360-371 [doi] Inapproximability of Minimum Vertex Cover on k-uniform k-partite HypergraphsVenkatesan Guruswami, Sushant Sachdeva, Rishi Saket. eccc, 20:71, 2013. [doi]
The following publications are possibly variants of this publication: