On-line algorithms for Steiner tree problems

Piotr Berman, Chris Coulston

    Research output: Contribution to journalConference article

    67 Citations (Scopus)

    Abstract

    The generalized Steiner tree problem is defined as follows. Given a graph with non-negative weights and a set of pairs of vertices find the minimum network of edges such that each pair of vertices is in the same connected component. We present an algorithm for the on-line Generalized Steiner Tree (GST) problem, and two other problems: Rectilinear Steiner Arborescence (RSA) and Symmetric Rectilinear Steiner Arborescence (SRSA). For each of these problems we provide polynomial time algorithms with performance ratios of O(log n). The constant factors hidden in the O-notation are small, in the case of the GST, we are within factor 2 from the proven lower bound. The previous best on-line GST algorithm (Awerbuch et at. [2]) was O(log2 n) competitive.

    Original languageEnglish (US)
    Pages (from-to)344-353
    Number of pages10
    JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
    StatePublished - Jan 1 1997
    EventProceedings of the 1997 29th Annual ACM Symposium on Theory of Computing - El Paso, TX, USA
    Duration: May 4 1997May 6 1997

    Fingerprint

    Polynomials

    All Science Journal Classification (ASJC) codes

    • Software

    Cite this

    @article{f3c9525d5573414ab733cd3433bdca06,
    title = "On-line algorithms for Steiner tree problems",
    abstract = "The generalized Steiner tree problem is defined as follows. Given a graph with non-negative weights and a set of pairs of vertices find the minimum network of edges such that each pair of vertices is in the same connected component. We present an algorithm for the on-line Generalized Steiner Tree (GST) problem, and two other problems: Rectilinear Steiner Arborescence (RSA) and Symmetric Rectilinear Steiner Arborescence (SRSA). For each of these problems we provide polynomial time algorithms with performance ratios of O(log n). The constant factors hidden in the O-notation are small, in the case of the GST, we are within factor 2 from the proven lower bound. The previous best on-line GST algorithm (Awerbuch et at. [2]) was O(log2 n) competitive.",
    author = "Piotr Berman and Chris Coulston",
    year = "1997",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "344--353",
    journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
    issn = "0734-9025",
    publisher = "Association for Computing Machinery (ACM)",

    }

    On-line algorithms for Steiner tree problems. / Berman, Piotr; Coulston, Chris.

    In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 01.01.1997, p. 344-353.

    Research output: Contribution to journalConference article

    TY - JOUR

    T1 - On-line algorithms for Steiner tree problems

    AU - Berman, Piotr

    AU - Coulston, Chris

    PY - 1997/1/1

    Y1 - 1997/1/1

    N2 - The generalized Steiner tree problem is defined as follows. Given a graph with non-negative weights and a set of pairs of vertices find the minimum network of edges such that each pair of vertices is in the same connected component. We present an algorithm for the on-line Generalized Steiner Tree (GST) problem, and two other problems: Rectilinear Steiner Arborescence (RSA) and Symmetric Rectilinear Steiner Arborescence (SRSA). For each of these problems we provide polynomial time algorithms with performance ratios of O(log n). The constant factors hidden in the O-notation are small, in the case of the GST, we are within factor 2 from the proven lower bound. The previous best on-line GST algorithm (Awerbuch et at. [2]) was O(log2 n) competitive.

    AB - The generalized Steiner tree problem is defined as follows. Given a graph with non-negative weights and a set of pairs of vertices find the minimum network of edges such that each pair of vertices is in the same connected component. We present an algorithm for the on-line Generalized Steiner Tree (GST) problem, and two other problems: Rectilinear Steiner Arborescence (RSA) and Symmetric Rectilinear Steiner Arborescence (SRSA). For each of these problems we provide polynomial time algorithms with performance ratios of O(log n). The constant factors hidden in the O-notation are small, in the case of the GST, we are within factor 2 from the proven lower bound. The previous best on-line GST algorithm (Awerbuch et at. [2]) was O(log2 n) competitive.

    UR - http://www.scopus.com/inward/record.url?scp=0030676109&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0030676109&partnerID=8YFLogxK

    M3 - Conference article

    AN - SCOPUS:0030676109

    SP - 344

    EP - 353

    JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

    JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

    SN - 0734-9025

    ER -