An exact algorithm for minimum CDS with shortest path constraint in wireless networks

Download PDF
Open Webpage

Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu Zhu, Ding-Zhu Du

Published: 2011, Last Modified: 15 Jan 2026Optim. Lett. 2011EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this paper, we study a minimum connected dominating set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pairwise shortest path should be included. Such a minimum CDS (we name this problem as SPCDS) is an important tache of some other algorithms for constructing a minimum CDS. We prove that finding such a minimum SPCDS can be achieved in polynomial time and design an exact algorithm with time complexity O(δ 2 n), where δ is the maximum node degree in communication graph.