Vertex cover might be hard to approximate to within 2 - ε

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The general problem of vertex cover on k-uniform hypergraphs is considered. The Ek-Vertex-Cover problem is the problem of finding a minimum size vertex cover in a k-uniform hypergraph. The hypergraph contains no independent set of size δ. It is concluded that vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual IEEE Conference on Computational Complexity
Pages379-386
Number of pages8
StatePublished - 2003
Event18th Annual IEEE Conference on Computational Complexity - Aarhus, Denmark
Duration: Jul 7 2003Jul 10 2003

Other

Other18th Annual IEEE Conference on Computational Complexity
CountryDenmark
CityAarhus
Period7/7/037/10/03

Fingerprint

Vertex Cover
Uniform Hypergraph
Independent Set
Hypergraph

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Khot, S., & Regev, O. (2003). Vertex cover might be hard to approximate to within 2 - ε. In Proceedings of the Annual IEEE Conference on Computational Complexity (pp. 379-386)

Vertex cover might be hard to approximate to within 2 - ε. / Khot, Subhash; Regev, Oded.

Proceedings of the Annual IEEE Conference on Computational Complexity. 2003. p. 379-386.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khot, S & Regev, O 2003, Vertex cover might be hard to approximate to within 2 - ε. in Proceedings of the Annual IEEE Conference on Computational Complexity. pp. 379-386, 18th Annual IEEE Conference on Computational Complexity, Aarhus, Denmark, 7/7/03.
Khot S, Regev O. Vertex cover might be hard to approximate to within 2 - ε. In Proceedings of the Annual IEEE Conference on Computational Complexity. 2003. p. 379-386
Khot, Subhash ; Regev, Oded. / Vertex cover might be hard to approximate to within 2 - ε. Proceedings of the Annual IEEE Conference on Computational Complexity. 2003. pp. 379-386
@inproceedings{9e753d534b964f99936db589f0a22add,
title = "Vertex cover might be hard to approximate to within 2 - ε",
abstract = "The general problem of vertex cover on k-uniform hypergraphs is considered. The Ek-Vertex-Cover problem is the problem of finding a minimum size vertex cover in a k-uniform hypergraph. The hypergraph contains no independent set of size δ. It is concluded that vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.",
author = "Subhash Khot and Oded Regev",
year = "2003",
language = "English (US)",
pages = "379--386",
booktitle = "Proceedings of the Annual IEEE Conference on Computational Complexity",

}

TY - GEN

T1 - Vertex cover might be hard to approximate to within 2 - ε

AU - Khot, Subhash

AU - Regev, Oded

PY - 2003

Y1 - 2003

N2 - The general problem of vertex cover on k-uniform hypergraphs is considered. The Ek-Vertex-Cover problem is the problem of finding a minimum size vertex cover in a k-uniform hypergraph. The hypergraph contains no independent set of size δ. It is concluded that vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.

AB - The general problem of vertex cover on k-uniform hypergraphs is considered. The Ek-Vertex-Cover problem is the problem of finding a minimum size vertex cover in a k-uniform hypergraph. The hypergraph contains no independent set of size δ. It is concluded that vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.

UR - http://www.scopus.com/inward/record.url?scp=0043016118&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0043016118&partnerID=8YFLogxK

M3 - Conference contribution

SP - 379

EP - 386

BT - Proceedings of the Annual IEEE Conference on Computational Complexity

ER -