455 search results - page 3 / 91 » A local approximation algorithm for maximum weight matching |
ICN
2005
Springer
13 years 11 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Wattenhofer et al. [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 maximu...
STACS
2010
Springer
13 years 3 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
ADHOCNOW
2008
Springer
14 years 3 days ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...