Discrete Mathematics - Topics on domination
Locality in distributed graph algorithms
SIAM Journal on Computing
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
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Connected Dominating Set and its Induced Position-less Sparse Spanner For Mobile Ad Hoc Networks
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed approximation algorithms in unit-disk graphs
DISC'06 Proceedings of the 20th international conference on Distributed Computing
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
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
Approximation and Online Algorithms
A randomized algorithm for determining dominating sets in graphs of maximum degree five
Theoretical Computer Science
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We present a distributed algorithm for finding a (1 + Ɛ)- approximation of a Minimum Connected Dominating Set in the class of Growth-Bounded graphs, which includes Unit Disk graphs. In addition, the computed Connected Dominating Set guarantees a constant stretch factor on the length of a shortest path with respect to the original graph and induces a subgraph of constant degree. The nodes do not require any positioning or distance information. The algorithm runs in O(TMIS+1/ƐO(1) ċ log* n)synchronous rounds, where TMIS is the time for computing a Maximal Independent Set (MIS) in the network graph. Using the fastest known deterministic algorithm for computing a MIS, the total running time is O((logΔ+1/ƐO(1)) ċ log* n), where Δ is the maximum degree of the network graph. If one allows randomization, the running time reduces to O((log log n+1/ƐO(1))ċ log* n) rounds.