A simple local 3-approximation algorithm for vertex cover

Details A simple local 3-approximation algorithm for vertex cover A simple local 3-approximation algorithm for vertex cover

2008-10-13

arxiv.org/abs/0810.2175v1

Information Processing Letters 109 (2009) 642-645

Computer Science

Distributed, Parallel, and Cluster Computing

6 pages, 1 figure

Scientific paper

10.1016/j.ipl.2009.02.017

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.

Affiliated with

Also associated with

No associations

Rating

A simple local 3-approximation algorithm for vertex cover does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A simple local 3-approximation algorithm for vertex cover, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple local 3-approximation algorithm for vertex cover will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-720049