(6+ε)-approximation for minimum weight dominating set in unit disk graphs

被引：0
|
作者：
Gao, Xiaofeng [1 ]
Huang, Yaochun [1 ]
Zhang, Zhao [2 ]
Wu, Weili [1 ]
机构：
[1] Univ Texas Dallas, Dept Comp Sci, Dallas, TX 75230 USA
[2] Xingjiang University, Coll Math & Syst Sci, Tin Shui Wai, Hong Kong, Peoples R China
来源：
COMPUTING AND COMBINATORICS, PROCEEDINGS | 2008年 / 5092卷
基金：
美国国家科学基金会;
关键词：
unit disk graph; approximation algorithm; dominating set;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It was a long-standing open problem whether the minimum weight dominating set in unit disk graphs has a polynomial-time constant-approximation. In 2006, Ambuhl et al solved this problem by presenting a 72-approximation for the minimum weight dominating set and also a 89-approximation for the minimum weight connected dominating set in unit disk graphs. In this paper, we improve their results by giving a (6 + epsilon)-approximation for the minimum weight dominating set and a (10 + epsilon)-approximation for the minimum weight connected dominating set in unit disk graphs where epsilon is any small positive number.
引用
收藏
页码：551 / +
页数：2
相关论文
共 50 条
12345