2754 search results - page 1 / 551 » Distributed Weighted Matching |
CORR
2004
Springer
13 years 4 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...
WDAG
2004
Springer
13 years 10 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...
DC
2011
12 years 4 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
WDAG
2009
Springer
13 years 11 months ago
2009
Springer
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
