Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

WEA
2007
Springer

favoriteEmaildiscussreport

111views Algorithms» more WEA 2007»

Vertex Cover Approximations on Random Graphs

13 years 10 months ago

Vertex Cover Approximations on Random Graphs

Download www.ru.is

Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3 2 , to ﬁnd approximate vertex covers for a large collection of randomly generated graphs. These reductions are extremely fast and even though they, by themselves are not guaranteed to ﬁnd a vertex cover, we manage to ﬁnd a 3 2 -approximate vertex cover for almost every single random graph we generate.

Eyjolfur Asgeirsson, Clifford Stein

Real-time Traffic

Algorithms | Approximation Ratio | Vertex Cover | Vertex Cover Problem | WEA 2007 |

claim paper

Related Content

» Complexity and Approximation Results for the Connected Vertex Cover Problem

» Maintaining a large matching and a small vertex cover

» Approximation Algorithms for Partial Covering Problems

» Private Approximation of Clustering and Vertex Cover

» Vertex Cover in Graphs with Locally Few Colors

» Covering Problems with Hard Capacities

» Greedy Algorithms for Minimisation Problems in Random Regular Graphs

» Connected Vertex Covers in Dense Graphs

» An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WEA
Authors	Eyjolfur Asgeirsson, Clifford Stein

Comments (0)