ENGLISH

A better constant-factor approximation for weighted dominating set in unit disk graph

By Huang Y. , Zhang Z. , Gao X.

Book information

Year
2008
DOI
10.1007/s10878-008-9146-0
Language
english
Format
PDF
Filesize
415 kB (425090 bytes)
Pages
16\16
Library
mexmat
Time added
2009-11-09 02:42:13

Description

This paper presents a (10 + ε)-approximation algorithm to compute minimum-weight connected dominating set (MWCDS) in unit disk graph. MWCDS is to select a vertex subset with minimum weight for a given unit disk graph, such that each vertex of the graph is contained in this subset or has a neighbor in this subset. Besides, the subgraph induced by this vertex subset is connected. Our algorithm is composed of two phases: the first phase computes a dominating set, which has approximation ratio 6 + ε (ε is an arbitrary positive number), while the second phase connects the dominating sets computed in the first phase, which has approximation ratio 4.

Similar books