On-line algorithms for Steiner tree problems

Piotr Berman, Chris Coulston

    Research output: Contribution to journalConference articlepeer-review

    74 Scopus citations

    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

    All Science Journal Classification (ASJC) codes

    • Software

    Fingerprint Dive into the research topics of 'On-line algorithms for Steiner tree problems'. Together they form a unique fingerprint.

    Cite this