EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS

DOI10.1142/S1793830909000348zbMath1184.68364MaRDI QIDQ5189986

Yingshu Li, Xiaofeng Gao, Weili Wu, Yi Zhu, James Willson, Zhonghua Qu

Publication date: 11 March 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

shortest path; distributed algorithm; connected dominating set

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

41A99: Approximations and expansions

Related Items

A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph, Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs, On the union of intermediate nodes of shortest paths, Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks, On minimum submodular cover with submodular cost, Wireless networking, dominating and packing, PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs

Cites Work

• Unit disk graphs
• Simple distributed \(\Delta+1\)-coloring of graphs
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• Planar Formulae and Their Uses
• On the hardness of approximating minimization problems
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• Simple heuristics for unit disk graphs