On minimum m-connected k-dominating set problem in unit disc graphs

Weiping Shang, Frances Yao, Pengjun Wan and Xiaodong Hu ()
Additional contact information
Weiping Shang: Chinese Academy of Sciences
Frances Yao: City University of Hong Kong
Pengjun Wan: Illinois Institute of Technology
Xiaodong Hu: Chinese Academy of Sciences

Journal of Combinatorial Optimization, 2008, vol. 16, issue 2, No 2, 99-106

Abstract: Abstract Minimum m-connected k-dominating set problem is as follows: Given a graph G=(V,E) and two natural numbers m and k, find a subset S⊆V of minimal size such that every vertex in V∖S is adjacent to at least k vertices in S and the induced graph of S is m-connected. In this paper we study this problem with unit disc graphs and small m, which is motivated by the design of fault-tolerant virtual backbone for wireless sensor networks. We propose two approximation algorithms with constant performance ratios for m≤2. We also discuss how to design approximation algorithms for the problem with arbitrarily large m.

Keywords: k-dominating set; m-connectivity; Unit disc graph; Approximation algorithm; Wireless sensor networks (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9124-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:16:y:2008:i:2:d:10.1007_s10878-007-9124-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9124-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().