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 条

[31] An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
Alipour, Sharareh
Ghodsi, Mohammad
Jafari, Amir
COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 209 - 221
[32] A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR VERTEX GUARDING A WV-POLYGON
Ashur, Stay
Filtser, Omrit
Katz, Matthew J.
JOURNAL OF COMPUTATIONAL GEOMETRY, 2021, 12 (01) : 128 - 144
[33] Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon
Browne, Reilly
Kasthurirangan, Prahlad Narasimham
Mitchell, Joseph S. B.
Polishchuk, Valentin
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 1357 - 1365
[34] A constant-factor approximation algorithm for optimal 1.5D terrain guarding
Ben-Moshe, Boaz
Katz, Matthew J.
Mitchell, Joseph S. B.
SIAM JOURNAL ON COMPUTING, 2007, 36 (06) : 1631 - 1647
[35] A constant-factor approximation algorithm for multi-vehicle collection for processing problem
E. Yücel
F. S. Salman
E. L. Örmeci
E. S. Gel
Optimization Letters, 2013, 7 : 1627 - 1642
[36] A constant-factor approximation algorithm for multi-vehicle collection for processing problem
Yucel, E.
Salman, F. S.
Ormeci, E. L.
Gel, E. S.
OPTIMIZATION LETTERS, 2013, 7 (07) : 1627 - 1642
[37] A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model
Kesselheim, Thomas
PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 1549 - 1559
[38] Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
Ahn, Jungho
Kim, Eun Jung
Lee, Euiwoong
ALGORITHMICA, 2022, 84 (07) : 2106 - 2133
[39] Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
Jungho Ahn
Eun Jung Kim
Euiwoong Lee
Algorithmica, 2022, 84 : 2106 - 2133
[40] A constant-factor approximation algorithm for the geometric k-MST problem in the plane
Mitchell, JSB
Blum, A
Chalasani, P
Vempala, S
SIAM JOURNAL ON COMPUTING, 1998, 28 (03) : 771 - 781

← 1 2 3 4 5 →