Sciweavers

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

6

ESA
2004
Springer

favoriteEmaildiscussreport

87views Algorithms» more ESA 2004»

A Fast Distributed Algorithm for Approximating the Maximum Matching

13 years 10 months ago

A Fast Distributed Algorithm for Approximating the Maximum Matching

Download math.la.asu.edu

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman

Real-time Traffic

ESA 2004 |

claim paper

Related Content

» A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

» Distributed algorithms for covering packing and maximum weighted matching

» Fast distributed approximation algorithms for vertex cover and set cover in anonymous netw...

» Fast and Distributed Computation of Schedules in Wireless Networks

» Distributed Weighted Matching

» Local algorithms in weakly coloured graphs

» Distributed Approximation Algorithms for Weighted Problems in MinorClosed Families

» Simple Distributed Weighted Matchings

» A Fast 52Approximation Algorithm for Hierarchical Scheduling

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ESA
Authors	Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Comments (0)