Complexity of network synchronization
Journal of the ACM (JACM)
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
Distributed data structures: a complexity-oriented view
Proceedings of the 4th international workshop on Distributed algorithms
Locality in distributed graph algorithms
SIAM Journal on Computing
How to allocate network centers
Journal of Algorithms
A parallel approximation algorithm for positive linear programming
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
Probabilistic recurrence relations
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Global Optimization Using Local Information with Applications to Flow Control
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Journal of Parallel and Distributed Computing
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributed algorithms for weighted problems in sparse graphs
Journal of Discrete Algorithms
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
A unified framework for cluster manager election and clustering mechanism in mobile ad hoc networks
Computer Standards & Interfaces
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Hierarchical routing in ad hoc networks using k-dominating sets
ACM SIGMOBILE Mobile Computing and Communications Review
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
A local algorithm for dominating sets of quasi-unit disk graphs
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
A new local algorithm for backbone formation in ad hoc networks
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Randomized distributed algorithm for vertex coloring
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Sensor-mission assignment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Rapid randomized pruning for fast greedy distributed algorithms
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
GAPs: Geospatial Abduction Problems
ACM Transactions on Intelligent Systems and Technology (TIST)
Algorithms for the minimum weight k-fold (connected) dominating set problem
Journal of Combinatorial Optimization
Hi-index | 0.00 |
The dominating set problem asks for a small subset D of nodes in a graph such that every node is either in D or adjacent to a node in D. This problem arises in a number of distributed network applications, where it is important to locate a small number of centers in the network such that every node is nearby at least one center. Finding a dominating set of minimum size is NP-complete, and the best known approximation is logarithmic in the maximum degree of the graph and is provided by the same simple greedy approach that gives the well-known logarithmic approximation result for the closely related set cover problem.We describe and analyze new randomized distributed algorithms for the dominating set problem that run in polylogarithmic time, independent of the diameter of the network, and that return a dominating set of size within a logarithmic factor from optimal, with high probability. In particular, our best algorithm runs in O(log n log Δ) rounds with high probability, where n is the number of nodes, Δ is one plus the maximum degree of any node, and each round involves a constant number of message exchanges among any two neighbors; the size of the dominating set obtained is within O (log Δ) of the optimal in expectation and within O(log n) of the optimal with high probability. We also describe generalizations to the weighted case and the case of multiple covering requirements.