A polylogarithmic approximation for computing non-metric terminal Steiner trees

Iftah Gamzu; Danny Segev

doi:10.1016/j.ipl.2010.07.006

A polylogarithmic approximation for computing non-metric terminal Steiner trees

Iftah Gamzu, Danny Segev

Department of Statistics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	826-829
Number of pages	4
Journal	Information Processing Letters
Volume	110
Issue number	18-19
DOIs	https://doi.org/10.1016/j.ipl.2010.07.006
State	Published - 15 Sep 2010

Bibliographical note

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.

Keywords

Approximation algorithms
Group Steiner tree
Terminal Steiner tree

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2010.07.006

Cite this

@article{0d019600151946179a218aadfd17bb21,

title = "A polylogarithmic approximation for computing non-metric terminal Steiner trees",

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.",

keywords = "Approximation algorithms, Group Steiner tree, Terminal Steiner tree",

author = "Iftah Gamzu and Danny Segev",

note = "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.",

year = "2010",

month = sep,

day = "15",

doi = "10.1016/j.ipl.2010.07.006",

language = "English",

volume = "110",

pages = "826--829",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "18-19",

}

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 - 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 -

A polylogarithmic approximation for computing non-metric terminal Steiner trees

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this