Complexity of network synchronization
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Locality in distributed graph algorithms
SIAM Journal on Computing
How to allocate network centers
Journal of Algorithms
SIAM Journal on Computing
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Generalized submodular cover problems and applications
Theoretical Computer Science
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed approximation: a survey
ACM SIGACT News
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the node-scheduling approach to topology control in ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks
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
Constant-time distributed dominating set approximation
Distributed Computing
Veracity radius: capturing the locality of distributed computations
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Using clustering information for sensor network localization
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight Local Approximation Results for Max-Min Linear Programs
Algorithmic Aspects of Wireless Sensor Networks
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Return of the primal-dual: distributed metric facilitylocation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Robust self-stabilizing construction of bounded size weight-based clusters
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ACM Computing Surveys (CSUR)
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph G = (V,E), and a capacity cap(v) ∈ N for each node v ∈ V , the CapMDS problem asks for a subset S ⊆ V of minimal cardinality, such that every network node not in S is covered by at least one neighbor in S, and every node v ∈ S covers at most cap(v) of its neighbors. We prove that in general graphs and even with uniform capacities, the problem is inherently non-local, i.e., every distributed algorithm achieving a non-trivial approximation ratio must have a time complexity that essentially grows linearly with the network diameter. On the other hand, if for some parameter ε 0, capacities can be violated by a factor of 1 + ε, CapMDS becomes much more local. Particularly, based on a novel distributed randomized rounding technique, we present a distributed bi-criteria algorithm that achieves an O(log Δ)-approximation in time O(log3n + log(n)/ε), where n and Δ denote the number of nodes and the maximal degree in G, respectively. Finally, we prove that in geometric network graphs typically arising in wireless settings, the uniform problem can be approximated within a constant factor in logarithmic time, whereas the non-uniform problem remains entirely non-local.