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 journalArticlepeer-review

    8 Citations (Scopus)

    Abstract

    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, mCDS(u,v)≤m(u,v) where m(u,v) denotes the number of intermediate nodes in the shortest path between u and v, and mCDS(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
    Volume30
    Issue number1
    DOIs
    Publication statusPublished - 2015 Jul 28

    Bibliographical note

    Funding Information:
    This work was supported by National Natural Science Foundation of China with Grants 61100191 and 11071271, and Shenzhen Strategic Emerging Industries Program with Grants No. ZDSY20120613125016389 and No. JCYJ20120613151201451, and Natural Scientific Research Innovation Foundation of Harbin Institute of Technology under Project 2011128. This work was also supported in part by National Science Foundation of USA under Grants CNS101630 and CCF0829993. This research was also jointly sponsored by MEST, Korea under WCU (R33-2008-000-10044-0), MEST, Korea under Basic Science Research Program (2011-0012216), and MKE, Korea under ITRC NIPA-2011-(C1090-1121-0008).

    Publisher Copyright:
    © 2013, Springer Science+Business Media New York.

    Keywords

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

    ASJC Scopus subject areas

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

    Fingerprint

    Dive into the research topics of 'PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs'. Together they form a unique fingerprint.

    Cite this