Simple Distributed Weighted Matchings

Details Simple Distributed Weighted Matchings Simple Distributed Weighted Matchings

2004-10-19

arxiv.org/abs/cs/0410047v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

Wattenhofer [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximum weighted matching of that graph. We show that a variant of the obvious sequential greedy algorithm [Pre99], that computes a weighted matching at most a factor 2 away from the maximum, is easily distributed. This yields the best known distributed approximation algorithm for this problem so far.

Affiliated with

Also associated with

No associations

Rating

Simple Distributed Weighted Matchings 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 Simple Distributed Weighted Matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple Distributed Weighted Matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512636