### 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 language | English (US) |
---|---|

Title of host publication | Proceedings of the Annual IEEE Conference on Computational Complexity |

Pages | 379-386 |

Number of pages | 8 |

State | Published - 2003 |

Event | 18th Annual IEEE Conference on Computational Complexity - Aarhus, Denmark Duration: Jul 7 2003 → Jul 10 2003 |

### Other

Other | 18th Annual IEEE Conference on Computational Complexity |
---|---|

Country | Denmark |

City | Aarhus |

Period | 7/7/03 → 7/10/03 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Mathematics

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Annual IEEE Conference on Computational Complexity.*pp. 379-386, 18th Annual IEEE Conference on Computational Complexity, Aarhus, Denmark, 7/7/03.

}

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 -