Steiner trees in uniformly quasi-bipartite graphs. (Q1853068)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Steiner trees in uniformly quasi-bipartite graphs.
scientific article

    Statements

    Steiner trees in uniformly quasi-bipartite graphs. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Analysis of algorithms
    0 references
    Approximation algorithms
    0 references
    Network design
    0 references
    Steiner tree problem in graphs
    0 references