TY - JOUR
T1 - A polylogarithmic approximation for computing non-metric terminal Steiner trees
AU - Gamzu, Iftah
AU - Segev, Danny
N1 - Funding 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.
PY - 2010/9/15
Y1 - 2010/9/15
N2 - 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.
AB - 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.
KW - Approximation algorithms
KW - Group Steiner tree
KW - Terminal Steiner tree
UR - http://www.scopus.com/inward/record.url?scp=77954499299&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2010.07.006
DO - 10.1016/j.ipl.2010.07.006
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:77954499299
SN - 0020-0190
VL - 110
SP - 826
EP - 829
JO - Information Processing Letters
JF - Information Processing Letters
IS - 18-19
ER -