121 search results - page 2 / 25 » Approximating Maximum Weight Matching in Near-Linear Time |
WEA
2007
Springer
15 years 3 months ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
AICT
2005
IEEE
15 years 3 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...
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
59
Voted
COLOGNETWENTE
2008
14 years 11 months ago
2008
IPL
2006
14 years 9 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