A polylogarithmic approximation for computing non-metric terminal Steiner trees

Authors:
Iftah Gamzu;Danny Segev
Affiliations:
Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel;Department of Statistics, University of Haifa, Haifa 31905, Israel
Venue:
Information Processing Letters
Year:
2010

Citing 10
Cited 0

A polylogarithmic approximation algorithm for the group Steiner tree problem

Journal of Algorithms
Approximation algorithms

Approximation algorithms
On the terminal Steiner tree problem

Information Processing Letters
Polylogarithmic inapproximability

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A note on the terminal Steiner tree problem

Information Processing Letters
The full steiner tree problem

Theoretical Computer Science
A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences - Special issue: STOC 2003
Algorithms for terminal Steiner trees

Theoretical Computer Science
On the full and bottleneck full Steiner tree problems

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
An improved LP-based approximation for steiner tree

Proceedings of the forty-second ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

The main contribution of this short note is to provide improved bounds on the approximability of constructing terminal Steiner trees in arbitrary undirected graphs. Technically speaking, our results are obtained by relating this computational task to that of computing group Steiner trees. As a secondary objective, we make a concentrated effort to distinguish between the factor by which constructed trees exceed the optimal backbone cost and between the deviation from the optimal terminal linking cost.