36 search results - page 1 / 8 » Distributed algorithms for covering, packing and maximum wei... |
298
click to vote
DC
2011
14 years 7 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...
162
Voted
WDAG
2009
Springer
16 years 2 months ago
2009
Springer
247
Voted
SPAA
2010
ACM
16 years 6 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
231
click to vote
PODC
2009
ACM
16 years 8 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
198
click to vote
ICPP
1987
IEEE
15 years 11 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...