Sciweavers

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

10

CORR
2008
Springer

favoriteEmaildiscussreport

133views Education» more CORR 2008»

A simple local 3-approximation algorithm for vertex cover

13 years 4 months ago

A simple local 3-approximation algorithm for vertex cover

Download www.cs.helsinki.fi

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required. Key words: approximation algorithms, distributed computing, graph algorithms, local algorithms

Valentin Polishchuk, Jukka Suomela

Real-time Traffic

Algorithms | Constant-time Distributed Algorithm | CORR 2008 | Education | Local Algorithms |

claim paper

Related Content

» Approximation of Partial Capacitated Vertex Cover

» Analysis of populationbased evolutionary algorithms for the vertex cover problem

» Local Maximal Matching and Local 2Approximation for Vertex Cover in UDGs

» Vertex Cover Approximations on Random Graphs

» A Local 2Approximation Algorithm for the Vertex Cover Problem

» A Stochastic Local Search Approach to Vertex Cover

» A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem

» Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

» Vertex Cover in Graphs with Locally Few Colors

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Valentin Polishchuk, Jukka Suomela

Comments (0)