### 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 language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Pages | 252-259 |

Number of pages | 8 |

Volume | 6508 LNCS |

Edition | PART 1 |

DOIs | |

Publication status | Published - 2010 Dec 1 |

Event | 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 - Kailua-Kona, HI, United States Duration: 2010 Dec 18 → 2010 Dec 20 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Number | PART 1 |

Volume | 6508 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 |
---|---|

Country | United States |

City | Kailua-Kona, HI |

Period | 10/12/18 → 10/12/20 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(PART 1 ed., Vol. 6508 LNCS, pp. 252-259). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6508 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-17458-2_21

**PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks.** / Du, Hongwei; Ye, Qiang; Zhong, Jioafei; Wang, Yuexuan; Lee, Wonjun; Park, Haesun.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*PART 1 edn, vol. 6508 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6508 LNCS, pp. 252-259, 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010, Kailua-Kona, HI, United States, 10/12/18. https://doi.org/10.1007/978-3-642-17458-2_21

}

TY - GEN

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

AU - Du, Hongwei

AU - Ye, Qiang

AU - Zhong, Jioafei

AU - Wang, Yuexuan

AU - Lee, Wonjun

AU - Park, Haesun

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78650831952&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650831952&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-17458-2_21

DO - 10.1007/978-3-642-17458-2_21

M3 - Conference contribution

AN - SCOPUS:78650831952

SN - 3642174574

SN - 9783642174575

VL - 6508 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 252

EP - 259

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -