2754 search results - page 1 / 551 » Distributed Weighted Matching |
85
Voted
CORR
2004
Springer
15 years 8 days 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...
103
Voted
WDAG
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
182
Voted
DC
2011
14 years 6 days ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
83
Voted
WDAG
2009
Springer
15 years 7 months ago
2009
Springer
75
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
