A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree

被引：8

作者：

Li, Xianyue ^{[1
]}

Zou, Feng ^{[2
]}

Huang, Yaochun ^{[2
]}

Kim, Donghyun ^{[2
]}

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

来源：

ALGORITHMICA | 2010年 / 56卷 / 03期

关键词：

Selected-internal Steiner tree; Approximation algorithm; ALGORITHMS;

D O I：

10.1007/s00453-009-9301-8

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The selected-internal Steiner minimum tree problem is a generalization of original Steiner minimum tree problem. Given a weighted complete graph G=(V,E) with weight function c, and two subsets R (') aSS RaS dagger V with |R-R (')|a parts per thousand yen2, selected-internal Steiner minimum tree problem is to find a minimum subtree T of G interconnecting R such that any leaf of T does not belong to R ('). In this paper, suppose c is metric, we obtain a (1+rho)-approximation algorithm for this problem, where rho is the best-known approximation ratio for the Steiner minimum tree problem.

引用

页码：333 / 341

页数：9

共 50 条

[1] A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree
Xianyue Li
Feng Zou
Yaochun Huang
Donghyun Kim
Weili Wu
Algorithmica, 2010, 56 : 333 - 341
[2] (1+ρ)-approximation for selected-internal Steiner minimum tree
Li, Xianyue
Huang, Yaochun
Zou, Feng
Kim, Donghyun
Wu, Weili
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, 5092 : 568 - +
[3] Approximating the selected-internal Steiner tree
Hsieh, Sun-Yuan
Yang, Shih-Cheng
THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 288 - 291
[4] The Clustered Selected-Internal Steiner Tree Problem
Chen, Yen Hung
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2022, 33 (01) : 55 - 66
[5] A Constant-Factor Approximation for Stochastic Steiner Forest
Gupta, Anupam
Kumar, Amit
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 659 - 668
[6] The Bottleneck Selected-Internal and Partial Terminal Steiner Tree Problems
Chen, Yen Hung
NETWORKS, 2016, 68 (04) : 331 - 339
[7] MAX-SNP hardness and approximation of selected-internal steiner trees
Hsieh, Sun-Yuan
Yang, Shih-Cheng
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 449 - 458
[8] A better constant-factor approximation for weighted dominating set in unit disk graph
Huang, Yaochun
Gao, Xiaofeng
Zhang, Zhao
Wu, Weili
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (02) : 179 - 194
[9] A better constant-factor approximation for weighted dominating set in unit disk graph
Yaochun Huang
Xiaofeng Gao
Zhao Zhang
Weili Wu
Journal of Combinatorial Optimization, 2009, 18 : 179 - 194
[10] A constant-factor approximation for weighted bond cover ☆
Kim, Eun Jung
Lee, Euiwoong
Thilikos, Dimitrios M.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 149

← 1 2 3 4 5 →