Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate within 2 - ɛ (2001)
| Venue: | IN PROCEEDINGS OF THE 34TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING |
| Citations: | 10 - 3 self |
BibTeX
@INPROCEEDINGS{Holmerin01vertexcover,
author = {Jonas Holmerin},
title = {Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate within 2 - ɛ},
booktitle = {IN PROCEEDINGS OF THE 34TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING},
year = {2001},
pages = {544--552},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We prove that Minimum Vertex Cover on 4-regular hyper-graphs (or in other words, Minimum Hitting Set where all sets have size exactly 4), is hard to approximate within 2 - epsilon. We also prove that the maximization version, in which we are allowed to pick B = pn elements in an n-vertex hyper-graph, and are asked to cover as many edges as possible, is hard to approximate within 1=(1 (1 p) ) when p 1=2 and within ((1 p) )=(1 (1 p) ) when p 4.
