Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Jonas Holmerin
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon
STOC, 2002.

STOC 2002
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2002-Holmerin,
	author        = "Jonas Holmerin",
	booktitle     = "{Proceedings of the 34th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/509907.509986",
	isbn          = "1-58113-495-9",
	pages         = "544--552",
	publisher     = "{ACM}",
	title         = "{Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon}",
	year          = 2002,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.