Sciweavers

WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
13 years 8 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
13 years 8 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...
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
13 years 10 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
WDAG
2009
Springer
195views Algorithms» more  WDAG 2009»
13 years 10 months ago
A Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
Matti Åstrand, Patrik Floréen, Valent...
WDAG
2009
Springer
187views Algorithms» more  WDAG 2009»
13 years 10 months ago
The Abstract MAC Layer
Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport
WDAG
2009
Springer
117views Algorithms» more  WDAG 2009»
13 years 10 months ago
Elastic Transactions
This paper presents elastic transactions, a variant of the transactional model. Upon conflict detection, an elastic transaction might drop what it did so far within a separate tra...
Pascal Felber, Vincent Gramoli, Rachid Guerraoui
WDAG
2009
Springer
103views Algorithms» more  WDAG 2009»
13 years 10 months ago
Distributed Discovery of Large Near-Cliques
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
Zvika Brakerski, Boaz Patt-Shamir
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
13 years 10 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