Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Locality in distributed graph algorithms
SIAM Journal on Computing
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
SIAM Journal on Computing
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
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Wireless Communications
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs
Journal of Algorithms
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Ad hoc networks beyond unit disk graphs
Wireless Networks
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
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
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 for Edge Colorings in UDGs
Graph-Theoretic Concepts in Computer Science
Local approximation algorithms for scheduling problems in sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
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
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
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
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Hi-index | 0.04 |
A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.