Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the terminal Steiner tree problem
Information Processing Letters
Heuristics for automated knowledge source integration and service composition
Computers and Operations Research
Algorithms for terminal Steiner trees
Theoretical Computer Science
A polylogarithmic approximation for computing non-metric terminal Steiner trees
Information Processing Letters
Diameter-constrained steiner tree
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
An improved approximation algorithm for the terminal Steiner tree problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Algorithms for terminal steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The minimum spanning tree problem with non-terminal set
Information Processing Letters
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
| Hi-index | 0.89 |
In 2002, Lin and Xue [Inform. Process. Lett. 84 (2002) 103-107] introduced a variant of the graph Steiner tree problem, in which each terminal vertex is required to be a leaf in the solution Steiner tree. They presented a ρ + 2 approximation algorithm, where ρ is the approximation ratio of the best known efficient algorithm for the regular graph Steiner tree problem. In this note, we derive a simplified algorithm with an improved approximation ratio of 2ρ (currently ρ ~ 1.550, see [SODA 2000, 2000, pp. 770-790]).