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 条

[21] Constant-Factor FPT Approximation for Capacitated k-Median
Adamczyk, Marek
Byrka, Jaroslaw
Marcinkowski, Jan
Meesum, Syed M.
Wlodarczyk, Michal
27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
[22] A Constant-Factor Approximation for Bounded Task Allocation Problem in Crowdsourcing
Wu, Shuang
Gao, Xiaofeng
Wu, Fan
Chen, Guihai
GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE, 2017,
[23] A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
Svensson, Ola
Tarnawski, Jakub
Vegh, Laszlo A.
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 204 - 213
[24] Constant-factor approximation algorithms for domination problems on circle graphs
Damian-Iordache, M
Pemmaraju, SV
ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 70 - 82
[25] A constant-factor approximation algorithm for the k-median problem
Charikar, M
Guha, S
Tardos, E
Shmoys, DB
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 65 (01) : 129 - 149
[26] A constant-factor approximation algorithm for the k-MST problem
Blum, A
Ravi, R
Vempala, S
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (01) : 101 - 108
[27] A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations
Dobzinski, Shahar
Li, Wenzheng
Rubinstein, Aviad
Vondrak, Jan
PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 467 - 478
[28] A constant-factor approximation algorithm for the multicommodity rent-or-buy problem
Kumar, A
Gupta, A
Roughgarden, T
FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 333 - 342
[29] A constant-factor approximation for directed latency in quasi-polynomial time
Friggstad, Zachary
Swamy, Chaitanya
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 126 : 44 - 58
[30] A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations
Li, Wenzheng
Vondrak, Jan
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 25 - 36

← 1 2 3 4 5 →