588 search results - page 2 / 118 » A Fast Distributed Algorithm for Approximating the Maximum M... |
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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
CORR
2004
Springer
13 years 5 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...
EUROPAR
2010
Springer
13 years 5 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...