Maximal Independent Set and Minimum Connected Dominating Set in Unit Disk Graphs
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Maximal Independent Set and Minimum Connected Dominating Set in Unit Disk Graphs
Published Date
2004-12-13
Publisher
Type
Report
Abstract
In ad hoc wireless networks, the connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set are based on construction of maximal independent set. The relation between the size
mis(G) of a maximum independent set and the size cds(G) of minimum connected dominating set in the same graph G plays an important role in establishing the performance ratio of those approximation algorithms. Previously, it is known that mis(G)<=4*cds(G)+1 for all unit disk graph G. In this paper, we improve it by showing mis(G)<=3.8*cds(G)+1.2.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
WuLi, Wei; Du, Hongwei; Jia, Xiaohua; Li, Yingshu; Huang, Scott C.-H.; Du, Ding-Zhu. (2004). Maximal Independent Set and Minimum Connected Dominating Set in Unit Disk Graphs. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215641.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.