DocumentCode :
2348663
Title :
Construction of 1- and 2-Connected k-Totally Dominating Set in Disk Graph
Author :
Li, Yefang ; Shuai, Tianping ; Ai, Wenbao
Author_Institution :
Sch. of Sci., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear :
2011
fDate :
15-19 April 2011
Firstpage :
1296
Lastpage :
1299
Abstract :
In this paper we consider the minimum m-Connected k-Totally Dominating Set (m-k-CTDS) problem in disk graph. We present two centralized approximation algorithms for 1-k-CTDS and 2-k-CTDS problems with approximation ratios 1+ln K/2(k-1)+K+K/k and 1+ln K/2(k-1)+K+3K/k, respectively, where K is 5 if k*=rmax/rmin=1, otherwise, K=6(3|log2 k*|+2).
Keywords :
approximation theory; graph theory; network theory (graphs); set theory; wireless sensor networks; 1-k-CTDS; 2-k-CTDS; centralized approximation algorithm; disk graph; m-k-CTDS problem; minimum reconnected k-totally dominating set problem; wireless sensor network; Ad hoc networks; Algorithm design and analysis; Approximation algorithms; Approximation methods; Wireless networks; Wireless sensor networks; disk graph; maximum independent set; minimum m-connected k-totally dominating set; wireless senor network.;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Sciences and Optimization (CSO), 2011 Fourth International Joint Conference on
Conference_Location :
Yunnan
Print_ISBN :
978-1-4244-9712-6
Electronic_ISBN :
978-0-7695-4335-2
Type :
conf
DOI :
10.1109/CSO.2011.110
Filename :
5957889
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2348663
بازگشت