Sciweavers

Share
OL
2011

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

8 years 9 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
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
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu
Added 17 May 2011
Updated 17 May 2011
Type Journal
Year 2011
Where OL
Authors Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu Zhu, Ding-Zhu Du
Comments (0)
books