(1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree

Authors:
Xianyue Li;Yaochun Huang;Feng Zou;Donghyun Kim;Weili Wu
Affiliations:
School of Mathematics and Statistics, Lanzhou University, Lanzhou, P.R. China 730000;Department of Computer Science, University of Texas at Dallas, Richardson, USA TX 75080;Department of Computer Science, University of Texas at Dallas, Richardson, USA TX 75080;Department of Computer Science, University of Texas at Dallas, Richardson, USA TX 75080;Department of Computer Science, University of Texas at Dallas, Richardson, USA TX 75080
Venue:
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Year:
2008

Citing 5
Cited 0

On component-size bounded Steiner trees

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
The k-Steiner Ratio in Graphs

SIAM Journal on Computing
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The full steiner tree problem

Theoretical Computer Science
Note: Approximating the selected-internal Steiner tree

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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^{'}\subsetneq R\subseteq V$ with |R茂戮驴 R茂戮驴| 茂戮驴 2, selected-internal Steiner minimum tree problem is to find a Steiner minimum tree Tof Gspanning Rsuch that any leaf of Tdoes not belong to R茂戮驴. In this paper, suppose cis metric, we obtain a (1 + ρ)-approximation algorithm for this problem, where ρis the best-known approximation ratio for the Steiner minimum tree problem.