Sciweavers

CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 11 months ago
Local algorithms in (weakly) coloured graphs
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 ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
PODC
2010
ACM
14 years 2 months ago
Brief announcement: exponential speed-up of local algorithms using non-local communication
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
Christoph Lenzen, Roger Wattenhofer
WAW
2007
Springer
113views Algorithms» more  WAW 2007»
14 years 5 months ago
Local Computation of PageRank Contributions
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
SPAA
2009
ACM
14 years 11 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...