Journal ArticleOPEN ACCESS

On approximation of the vertex cover problem in hypergraphs

Discrete Optimization (2005) 2(1) 101-111
DOI: 10.1016/j.disopt.2004.11.002
14Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper deals with approximation of the vertex cover problem in hypergraphs with bounded degree and bounded number of neighboring vertices. For hypergraphs with edges of size at most r and degree bounded by Δ we extend a result of Krivelevich and obtain a ⌈βr⌉ approximation algorithm, where 0

Author supplied keywords

Cite

CITATION STYLE

APA

Okun, M. (2005). On approximation of the vertex cover problem in hypergraphs. Discrete Optimization, 2(1), 101–111. https://doi.org/10.1016/j.disopt.2004.11.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free