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.
Bibliographical noteFunding Information:
1 Supported by the Israel Science Foundation, by the European Commission under the Integrated Project QAP funded by the IST directorate as Contract Number 015848, by a European Research Council (ERC) Starting Grant, and by the Wolfson Family Charitable Trust.
- Approximation algorithms
- Group Steiner tree
- Terminal Steiner tree
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications