142 search results - page 2 / 29 » Approximate maximum weight branchings |
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
AICT
2005
IEEE
13 years 10 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
13 years 10 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 ...
COLOGNETWENTE
2008
13 years 6 months ago
2008
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
