PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs

Lidong Wu, Hongwei Du, Weili Wu, Yuqing Zhu, Ailan Wang, Wonjun Lee

Research output: Contribution to journalArticle

6 Citations (Scopus)


Connected dominating set (CDS) has played an important role in building virtual backbone, which is used on unicast, multicast, and fault-tolerant routing in wireless sensor networks. In order to reduce traffic congestion and communication delay, a routing-cost constrained minimum CDS (ROC–CDS) has been studied extensively in the literature. In this paper, we present a PTAS for αROC–CDS where α≥5, that is, there exists a polynomial-time (1+ε)-approximation for minimum CDS under constraint that for every pair of nodes u and v, m<inf>CDS</inf>(u,v)≤m(u,v) where m(u,v) denotes the number of intermediate nodes in the shortest path between u and v, and m<inf>CDS</inf>(u,v) denotes the number of intermediate nodes of the shortest path between u and v through CDS produced by the approximation algorithm.

Original languageEnglish
Pages (from-to)18-26
Number of pages9
JournalJournal of Combinatorial Optimization
Issue number1
Publication statusPublished - 2015 Jul 28



  • Algorithm PTAS
  • Growth bounded graphs
  • Minimum connected dominating set
  • Routing cost constraint

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics
  • Computational Theory and Mathematics
  • Computer Science Applications
  • Control and Optimization

Cite this