Efficient distributed algorithms for topology control problem with shortest path constraints
DOI10.1142/S1793830909000348zbMATH Open1184.68364OpenAlexW2147926631MaRDI QIDQ5189986FDOQ5189986
Authors: James Willson, Xiaofeng Gao, Zhonghua Qu, Yi Zhu, Yingshu Li, Weili Wu 
Publication date: 11 March 2010
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830909000348
Recommendations
- A distributed approximation algorithm for the bottleneck connected dominating set problem
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks
- Routing-efficient CDS construction in disk-containment graphs
- Algorithms for Minimum m-Connected k-Dominating Set Problem
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximations and expansions (41A99)
Cites Work
- Unit disk graphs
- Planar Formulae and Their Uses
- On the hardness of approximating minimization problems
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Simple distributed \(\Delta+1\)-coloring of graphs
- Simple heuristics for unit disk graphs
Cited In (12)
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
- On minimum submodular cover with submodular cost
- Distributed Computing – IWDC 2005
- The optimal design of low-latency virtual backbones
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
- CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL
- On the union of intermediate nodes of shortest paths
- Wireless networking, dominating and packing
- Routing-efficient CDS construction in disk-containment graphs
- A PTAS for weak minimum routing cost connected dominating set of unit disk graph
This page was built for publication: Efficient distributed algorithms for topology control problem with shortest path constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189986)
