A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs

被引：0

作者：

Li, Xianyue ^{[1
]}

Xu, Xiao-Hua ^{[3
]}

Zou, Feng ^{[2
]}

Du, Hongwei ^{[3
]}

Wan, Pengjun ^{[3
]}

Wang, Yuexuan ^{[4
]}

Wu, Weili ^{[2
]}

机构：

[1] Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China

[2] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75080 USA

[3] IIT, Dept Comp Sci, Chicago, IL 60616 USA

[4] Tsinghua Univ, Inst Theoret Comp Sci, Beijing 100084, Peoples R China

来源：

COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS | 2009年 / 5573卷

关键词：

Node-weighted Steiner tree; minimum weighted connected dominating set; polynomial-time approximation scheme; approximation algorithm; CONNECTED DOMINATING SETS; APPROXIMATION ALGORITHMS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V --> R+ and a subset X of V, the node-weighted Steiner tree problem is to find a Steiner tree for the set X such that its total weight is minimum. In this paper, we study this problem in unit disk graphs and present a (1+epsilon)-approximation algorithm for any epsilon > 0, when the given set of vertices is c-local. As an application, we use node-weighted Steiner tree to solve the node-weighted connected dominating set problem in unit disk graphs and obtain a (5+epsilon)-approximation algorithm.

引用

页码：36 / +

页数：3

共 50 条

[1] Node-weighted Steiner tree approximation in unit disk graphs
Feng Zou
Xianyue Li
Suogang Gao
Weili Wu
[J]. Journal of Combinatorial Optimization, 2009, 18 : 342 - 349
[2] Approximations for node-weighted Steiner tree in unit disk graphs
Xu, X.
Wang, Y.
Du, H.
Wan, P. -J.
Zou, F.
Li, X.
Wu, W.
[J]. OPTIMIZATION LETTERS, 2010, 4 (03) : 405 - 416
[3] Approximations for node-weighted Steiner tree in unit disk graphs
X. Xu
Y. Wang
H. Du
P.-J. Wan
F. Zou
X. Li
W. Wu
[J]. Optimization Letters, 2010, 4 : 405 - 416
[4] Node-weighted Steiner tree approximation in unit disk graphs
Zou, Feng
Li, Xianyue
Gao, Suogang
Wu, Weili
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (04) : 342 - 349
[5] Two constant approximation algorithms for node-weighted Steiner tree in unit disk graphs
Zou, Feng
Li, Xianyue
Kim, Donghyun
Wu, Weili
[J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 278 - +
[6] Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
Demaine, Erik D.
Hajiaghayi, MohammadTaghi
Klein, Philip N.
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 328 - +
[7] Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
Demaine, Erik D.
Hajiaghayi, Mohammadtaghi
Klein, Philip N.
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2014, 10 (03)
[8] THE NODE-WEIGHTED STEINER TREE PROBLEM
SEGEV, A
[J]. NETWORKS, 1987, 17 (01) : 1 - 17
[9] The Node-Weighted Steiner problem in graphs of restricted node weights
Angelopoulos, Spyros
[J]. ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 208 - 219
[10] Online Node-weighted Steiner Tree and Related Problems
Naor, Joseph
Panigrahi, Debmalya
Singh, Mohit
[J]. 2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 210 - 219

← 1 2 3 4 5 →