Approximating the minimum-degree steiner tree to within one of optimal

Martin Furer, Balaji Raghavachari

    Research output: Contribution to journalArticle

    134 Citations (Scopus)

    Abstract

    The problem of constructing a spanning tree for a graph G = (V, E) with n vertices whose maximal degree is the smallest among all spanning trees of G is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of distinguished vertices D ⊆ V is given. A minimum-degree Steiner tree is a tree of minimum degree which spans at least the set D. Iterative polynomial time approximation algorithms for the problems are given. The algorithms compute trees whose maximal degree is at most Δ* + 1, where Δ* is the degree of some optimal tree for the respective problems. Unless P = NP, this is the best bound achievable in polynomial time.

    Original languageEnglish (US)
    Pages (from-to)409-423
    Number of pages15
    JournalJournal of Algorithms
    Volume17
    Issue number3
    DOIs
    StatePublished - Jan 1 1994

    Fingerprint

    Steiner Tree
    Minimum Degree
    Polynomials
    Approximation algorithms
    Spanning tree
    Tree Algorithms
    Graph in graph theory
    Polynomial-time Algorithm
    Approximation Algorithms
    Polynomial time
    NP-complete problem

    All Science Journal Classification (ASJC) codes

    • Control and Optimization
    • Computational Mathematics
    • Computational Theory and Mathematics

    Cite this

    Furer, Martin ; Raghavachari, Balaji. / Approximating the minimum-degree steiner tree to within one of optimal. In: Journal of Algorithms. 1994 ; Vol. 17, No. 3. pp. 409-423.
    @article{2cc5a1c8202241ca810d9473870a8256,
    title = "Approximating the minimum-degree steiner tree to within one of optimal",
    abstract = "The problem of constructing a spanning tree for a graph G = (V, E) with n vertices whose maximal degree is the smallest among all spanning trees of G is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of distinguished vertices D ⊆ V is given. A minimum-degree Steiner tree is a tree of minimum degree which spans at least the set D. Iterative polynomial time approximation algorithms for the problems are given. The algorithms compute trees whose maximal degree is at most Δ* + 1, where Δ* is the degree of some optimal tree for the respective problems. Unless P = NP, this is the best bound achievable in polynomial time.",
    author = "Martin Furer and Balaji Raghavachari",
    year = "1994",
    month = "1",
    day = "1",
    doi = "10.1006/jagm.1994.1042",
    language = "English (US)",
    volume = "17",
    pages = "409--423",
    journal = "Journal of Algorithms",
    issn = "0196-6774",
    publisher = "Academic Press Inc.",
    number = "3",

    }

    Approximating the minimum-degree steiner tree to within one of optimal. / Furer, Martin; Raghavachari, Balaji.

    In: Journal of Algorithms, Vol. 17, No. 3, 01.01.1994, p. 409-423.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Approximating the minimum-degree steiner tree to within one of optimal

    AU - Furer, Martin

    AU - Raghavachari, Balaji

    PY - 1994/1/1

    Y1 - 1994/1/1

    N2 - The problem of constructing a spanning tree for a graph G = (V, E) with n vertices whose maximal degree is the smallest among all spanning trees of G is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of distinguished vertices D ⊆ V is given. A minimum-degree Steiner tree is a tree of minimum degree which spans at least the set D. Iterative polynomial time approximation algorithms for the problems are given. The algorithms compute trees whose maximal degree is at most Δ* + 1, where Δ* is the degree of some optimal tree for the respective problems. Unless P = NP, this is the best bound achievable in polynomial time.

    AB - The problem of constructing a spanning tree for a graph G = (V, E) with n vertices whose maximal degree is the smallest among all spanning trees of G is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of distinguished vertices D ⊆ V is given. A minimum-degree Steiner tree is a tree of minimum degree which spans at least the set D. Iterative polynomial time approximation algorithms for the problems are given. The algorithms compute trees whose maximal degree is at most Δ* + 1, where Δ* is the degree of some optimal tree for the respective problems. Unless P = NP, this is the best bound achievable in polynomial time.

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

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

    U2 - 10.1006/jagm.1994.1042

    DO - 10.1006/jagm.1994.1042

    M3 - Article

    AN - SCOPUS:0000245114

    VL - 17

    SP - 409

    EP - 423

    JO - Journal of Algorithms

    JF - Journal of Algorithms

    SN - 0196-6774

    IS - 3

    ER -