Approximability of the Vertex Cover Problem in Power Law Graphs

  title={Approximability of the Vertex Cover Problem in Power Law Graphs},
  author={Mikael Gast and Mathias Hauptmann},
  journal={Theor. Comput. Sci.},
In this paper we construct an approximation algorithm for the Minimum Vertex Cover Problem (Min-VC) with an expected approximation ratio of 2 − ζ(β)−1− 1 2β 2βζ(β−1)ζ(β) for random Power Law Graphs (PLG) in the (α, β)-model of Aiello et. al.. We obtain this result by combining the Nemhauser and Trotter approach for Min-VC with a new deterministic rounding procedure which achieves an approximation ratio of 2 on a subset of low degree vertices for which the expected contribution to the cost of… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.
3 Citations
38 References
Similar Papers


Publications referenced by this paper.

Similar Papers

Loading similar papers…