A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
DOI10.1142/S0129054110007362zbMATH Open1192.68847MaRDI QIDQ3569287FDOQ3569287
Authors: Sayaka Kamei, Hirotsugu Kakugawa 
Publication date: 18 June 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- New self-stabilizing algorithms for minimal weakly connected dominating sets
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
approximation algorithmfault-tolerantad hoc networkminimum connected dominating setself-stabilizing algorithm
Approximation algorithms (68W25) Semisimple Lie groups and their representations (22E46) Differential geometry of symmetric spaces (53C35) Noncompact Lie groups of transformations (57S20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Unit disk graphs
- A self-stabilizing algorithm for constructing breadth-first trees
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- Simple heuristics for unit disk graphs
- A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
Cited In (11)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
- Timer-based composition of fault-containing self-stabilizing protocols
- Principles of Distributed Systems
- Self-stabilizing multicast protocols for ad hoc networks.
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
- New self-stabilizing algorithms for minimal weakly connected dominating sets
- Distributed minimum dominating set approximations in restricted families of graphs
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
- Self-Stabilizing Domination Algorithms
This page was built for publication: A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569287)
