A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
From MaRDI portal
Publication:3569287
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)
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
Cites work
- A self-stabilizing algorithm for constructing breadth-first trees
- A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Self-stabilization
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- Self-stabilizing systems in spite of distributed control
- Simple heuristics for unit disk graphs
- Unit disk graphs
Cited in
(11)- New self-stabilizing algorithms for minimal weakly connected dominating sets
- Timer-based composition of fault-containing self-stabilizing protocols
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
- Principles of Distributed Systems
- Distributed minimum dominating set approximations in restricted families of graphs
- Self-Stabilizing Domination Algorithms
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
- Self-stabilizing multicast protocols for ad hoc networks.
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs
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)
