PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks

Hongwei Du, Qiang Ye, Jioafei Zhong, Yuexuan Wang, Wonjun Lee, Haesun Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

To reduce routing cost and to improve road load balance, we study a problem of minimizing size of connected dominating set D under constraint that for any two nodes u and v, the routing cost through D is within a factor of α from the minimum, the cost of the shortest path between u and v. We show that for α ≥ 5, this problem in unit disk graphs has a polynomial-time approximation scheme, that is, for any ε > 0, there is a polynomial-time (1 + ε)-approximation.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings
Pages252-259
Number of pages8
EditionPART 1
DOIs
Publication statusPublished - 2010
Event4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 - Kailua-Kona, HI, United States
Duration: 2010 Dec 182010 Dec 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6508 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010
CountryUnited States
CityKailua-Kona, HI
Period10/12/1810/12/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks'. Together they form a unique fingerprint.

Cite this