A belated proof of self-stabilization
Distributed Computing
On the costs of self-stabilization
Information Processing Letters
An exercise in proving self-stabilization with a variant function
Information Processing Letters
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Stabilization of general loop-free routing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Tight bounds for parallel randomized load balancing: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Distributed graph coloring in a few rounds
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
Lower bounds for local approximation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
No sublogarithmic-time approximation scheme for bipartite vertex cover
DISC'12 Proceedings of the 26th international conference on Distributed Computing
ACM Computing Surveys (CSUR)
Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
A quasi-polynomial time partition oracle for graphs with an excluded minor
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
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
| Hi-index | 0.00 |
We give deterministic distributed algorithms that given 茂戮驴 0 find in a planar graph G, (1±茂戮驴)-approximations of a maximum independent set, a maximum matching, and a minimum dominating set. The algorithms run in O(log*|G|) rounds. In addition, we prove that no faster deterministic approximation is possible and show that if randomization is allowed it is possible to beat the lower bound for deterministic algorithms.