Sciweavers

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

13

WDAG
2004
Springer

favoriteEmaildiscussreport

130views Algorithms» more WDAG 2004»

Distributed Weighted Matching

13 years 9 months ago

Distributed Weighted Matching

Download dcg.ethz.ch

Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximation ratio of the tree algorithm is constant. In particular, the approximation ratio is 4. For the general graph algorithm we prove a constant ratio bound of 5 and a polylogarithmic time complexity of O(log2 n).

Mirjam Wattenhofer, Roger Wattenhofer

Real-time Traffic

Algorithms | Approximation Ratio | General Weighted Graphs | Time Complexity | WDAG 2004 |

claim paper

Related Content

» Simple Distributed Weighted Matchings

» Distributed algorithms for covering packing and maximum weighted matching

» Distributed Fractional Packing and Maximum Weighted bMatching via TailRecursive Duality

» Distributed Weighted Vertex Cover via Maximal Matchings

» Parallel Algorithm for Maximum Weight Matching in Trees

» Equivalence of LP Relaxation and MaxProduct for Weighted Matching in General Graphs

» A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

» Diffeomorphic Matching of Distributions A New Approach for Unlabelled PointSets and SubMan...

» Distributed Approximation Algorithms for Weighted Problems in MinorClosed Families

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	WDAG
Authors	Mirjam Wattenhofer, Roger Wattenhofer

Comments (0)