Sciweavers

18 search results - page 3 / 4
» wdag 2009
Sort
View
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 5 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
14 years 5 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
WDAG
2009
Springer
91views Algorithms» more  WDAG 2009»
14 years 5 months ago
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 5 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 3 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...