Results 1 
7 of
7
Distributed Weighted Matching
 In 18th DISC (Amsterdam, the Netherlands, 2004), R. Guerraoui (Ed.), LNCS 3274
, 2003
"... 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 approximation ratio of the tree algorithm is constant. In particular, the approximation ratio is 4. For the general graph algorithm we pro ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
(Show Context)
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 approximation ratio of the tree algorithm is constant. In particular, the approximation ratio is 4. For the general graph algorithm we prove a constant ratio bound of 5 and a polylogarithmic time complexity of O(log n).
A nearoptimal distributed fully dynamic algorithm for maintaining sparse spanners
 Proceedings of the twentysixth annual ACM symposium on Principles of distributed computing
, 2006
"... Currently, there are no known explicit algorithms for the great majority of graph problems in the dynamic distributed messagepassing model. Instead, most stateoftheart dynamic distributed algorithms are constructed by composing a static algorithm for the problem at hand with a simulation techniq ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Currently, there are no known explicit algorithms for the great majority of graph problems in the dynamic distributed messagepassing model. Instead, most stateoftheart dynamic distributed algorithms are constructed by composing a static algorithm for the problem at hand with a simulation technique that converts static algorithms to dynamic ones. We argue that this powerful methodology does not provide satisfactory solutions for many important dynamic distributed problems, and this necessitates developing algorithms for these problems from scratch. In this paper we develop a fully dynamic distributed algorithm for maintaining sparse spanners. Our algorithm improves drastically the quiescence time of the stateoftheart algorithm for the problem. Moreover, we show that the quiescence time of our algorithm is optimal up to a small constant factor. In addition, our algorithm improves significantly upon the stateoftheart algorithm in all efficiency parameters, specifically, it has smaller quiescence message and space complexities, and smaller local processing time. Finally, our algorithm is selfcontained and fairly simple, and is, consequently, amenable to implementation on unsophisticated network devices.
Distributed Approximation in a Constant Number of Rounds
"... We present a novel efficient distributed approximation algorithm for covering and packing linear programs (LP). We show that on general graphs, for this class of LPs, a nontrivial approximation ratio can be achieved. Namely, for k ∈ O(log(ρ∆)), our (deterministic) algorithm achieves a (ρ∆) 1/kappr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We present a novel efficient distributed approximation algorithm for covering and packing linear programs (LP). We show that on general graphs, for this class of LPs, a nontrivial approximation ratio can be achieved. Namely, for k ∈ O(log(ρ∆)), our (deterministic) algorithm achieves a (ρ∆) 1/kapproximation in O(k 2) rounds, using only messages of size O(log(ρ∆)). Increasing k, we get an (1 + ε)approximation in time O(log 2 (ρ∆)/ε 4) and therefore only log 2 rounds are needed in order to get a constant approximation ratio. Additionally, we show that by combining our LP algorithm with randomized rounding techniques, we obtain efficient distributed approximation algorithms for a number of combinatorial problems. 1 Introduction and Related Work Achieving a global goal based on local information only is one of the key challenges when developing fast distributed algorithms. In k rounds of communication, a network node can only gather information about nodes which are at most k hops away. Not surprisingly, many global criteria such as obtaining a spanning tree cannot be met by a local algorithm, i.e., by an algorithm whose time complexity is much smaller than
ACM SIGACT news distributed computing column 5
 SIGACT News
"... The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and th ..."
Abstract
 Add to MetaCart
(Show Context)
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web. This issue consists of: • “Travelling through Wormholes: a new look at Distributed Systems Models, ” by Paulo E. Veríssimo. Many thanks to Paulo for his contribution to this issue. Request for Collaborations: Please send me any suggestions for material I should be including in this column, including news and communications, open problems, and authors willing to write a guest column or to review an event related to theory of distributed computing. Travelling through Wormholes: a new look at Distributed Systems Models