239 search results - page 3 / 48 » A Parallel Approximation Algorithm for the Weighted Maximum ... |
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...
FOCS
2008
IEEE
14 years 1 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
AICT
2005
IEEE
13 years 11 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
COLOGNETWENTE
2008
13 years 7 months ago
2008
IPL
2006
13 years 5 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing