Survey of local algorithms

Authors:
Jukka Suomela
Affiliations:
University of Helsinki and Helsinki Institute for Information Technology HIIT, Finland
Venue:
ACM Computing Surveys (CSUR)
Year:
2013

Citing 74
Cited 13

Randomized algorithms

Randomized algorithms
What Can Be Computed Locally?

SIAM Journal on Computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases

IEEE Transactions on Parallel and Distributed Systems
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Local Labeling and Resource Allocation Using Preprocessing

SIAM Journal on Computing
On the distributed complexity of computing maximal matchings

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization

Self-stabilization
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Random lifts of graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms

Approximation algorithms
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
A 2-approximation algorithm for the minimum weight edge dominating set problem

Discrete Applied Mathematics
On the Distributed Complexity of Computing Maximal Matchings

SIAM Journal on Discrete Mathematics
Approximating the Domatic Number

SIAM Journal on Computing
On Pseudorandom Generators in NC

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
An Effective Characterization of Computability in Anonymous Networks

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
The Kronecker Product and Local Computations in Graphs

CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Global Optimization Using Local Information with Applications to Flow Control

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Local computations on static and dynamic graphs

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
What cannot be computed locally!

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Distributed approximation: a survey

ACM SIGACT News
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs

Journal of Algorithms
Proof labeling schemes

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On the locality of bounded growth

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Networking Wireless Sensors

Networking Wireless Sensors
Constant-time distributed dominating set approximation

Distributed Computing
Localized construction of bounded degree and planar spanner for wireless ad hoc networks

Mobile Networks and Applications
Impact of interference on multi-hop wireless network performance

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Local solutions for global problems in wireless networks

Journal of Discrete Algorithms
Distributed approximation of capacitated dominating sets

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms

Theoretical Computer Science
Cryptography in $NC^0$

SIAM Journal on Computing
Multiple Kronecker covering graphs

European Journal of Combinatorics
Ad hoc networks beyond unit disk graphs

Wireless Networks
A log-star distributed maximal independent set algorithm for growth-bounded graphs

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Fast Distributed Approximations in Planar Graphs

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Computing Lightweight Spanners Locally

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Leveraging Linial's Locality Limit

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A Limit to the Power of Multiple Nucleation in Self-assembly

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Constant-Time Approximation Algorithms via Local Improvements

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Tight Local Approximation Results for Max-Min Linear Programs

Algorithmic Aspects of Wireless Sensor Networks
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs

Approximation and Online Algorithms
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs

Theoretical Computer Science
A simple local 3-approximation algorithm for vertex cover

Information Processing Letters
Distributed (δ+1)-coloring in linear (in δ) time

Proceedings of the forty-first annual ACM symposium on Theory of computing
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
Weak graph colorings: distributed algorithms and applications

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
An optimal local approximation algorithm for max-min linear programs

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Local Algorithms: Self-stabilization on Speed

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Semi-matchings for bipartite graphs and load balancing

Journal of Algorithms
Constructing Labeling Schemes through Universal Matrices

Algorithmica
Local approximation algorithms for scheduling problems in sensor networks

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A local 2-approximation algorithm for the vertex cover problem

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Almost Stable Matchings by Truncating the Gale–Shapley Algorithm

Algorithmica - Special Issue: Matching Under Preferences; Guest Editors: David F. Manlove, Robert W. Irving and Kazuo Iwama
Distributed algorithms for edge dominating sets

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Minimum dominating set approximation in graphs of bounded arboricity

DISC'10 Proceedings of the 24th international conference on Distributed computing
Local 7-coloring for planar subgraphs of unit disk graphs

Theoretical Computer Science
Locally checkable proofs

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Analysing local algorithms in location-aware quasi-unit-disk graphs

Discrete Applied Mathematics
Brief announcement: distributed approximations for the semi-matching problem

DISC'11 Proceedings of the 25th international conference on Distributed computing
Local Distributed Decision

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
On distributed verification

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Efficient distributed weighted matchings on trees

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Local Approximability of Max-Min and Min-Max Linear Programs

Theory of Computing Systems - Special Issue: Parallelism in Algorithms and Architectures
Local construction of planar spanners in unit disk graphs with irregular transmission ranges

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Distributed computing with advice: information sensitivity of graph coloring

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Analysing local algorithms in location-aware quasi-unit-disk graphs

Discrete Applied Mathematics
Distributed maximal matching: greedy is optimal

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Lower bounds for local approximation

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Weak models of distributed computing, with connections to modal logic

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Deterministic local algorithms, unique identifiers, and fractional graph colouring

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
No sublogarithmic-time approximation scheme for bipartite vertex cover

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Distributed 2-approximation algorithm for the semi-matching problem

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Stone age distributed computing

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Exploiting locality in distributed SDN control

Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Efficient computation of balanced structures

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Lower bounds for local approximation

Journal of the ACM (JACM)
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the operation of large-scale distributed systems. Furthermore, even though the model of local algorithms is very limited, in recent years we have seen many positive results for nontrivial problems. This work surveys the state-of-the-art in the field, covering impossibility results, deterministic local algorithms, randomized local algorithms, and local algorithms for geometric graphs.