A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Locality in distributed graph algorithms
SIAM Journal on Computing
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed approximation: a survey
ACM SIGACT News
Distributed algorithms for weighted problems in sparse graphs
Journal of Discrete Algorithms
Distributed almost exact approximations for minor-closed families
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Distributed approximation algorithms for planar graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Distributed packing in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Distributed graph coloring in a few rounds
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed families. To complement these results we indicate that no efficient distributed algorithm for the minimum weight connected dominating set exists.