Approximability of the Vertex Cover Problem in Power Law Graphs
Data Structures and Algorithms
2012-04-06 v2 Social and Information Networks
Abstract
In this paper we construct an approximation algorithm for the Minimum Vertex Cover Problem (Min-VC) with an expected approximation ratio of 2-f(beta) for random Power Law Graphs (PLG) in the (alpha,beta)-model of Aiello et. al., where f(beta) is a strictly positive function of the parameter beta. 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 3/2 on a subset of low degree vertices for which the expected contribution to the cost of the associated linear program is sufficiently large.
Keywords
Cite
@article{arxiv.1204.0982,
title = {Approximability of the Vertex Cover Problem in Power Law Graphs},
author = {Mikael Gast and Mathias Hauptmann},
journal= {arXiv preprint arXiv:1204.0982},
year = {2012}
}
Comments
16 pages, 2 figures