On approximation of the vertex cover problem in hypergraphs

  • Authors:

  • Michael Okun

  • Affiliations:

  • School of Computer Science, The Hebrew University of Jerusalem, Jerusalem 91904, Israel

  • Venue:
  • Discrete Optimization
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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 @D we extend a result of Krivelevich and obtain a @?@br@? approximation algorithm, where 0=1-1/e the approximation guarantee of our algorithm is better than that of the greedy algorithm. For hypergraphs in which each vertex has at most D adjacent vertices and its degree is bounded by @D=D, we show that the greedy heuristic provides an H(@D,D)=