Dynamic Steiner Tree Problem (Q3977293)

From MaRDI portal
Revision as of 22:02, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dynamic Steiner Tree Problem
scientific article

    Statements

    title
    Dynamic Steiner Tree Problem (English)
    0 references
    author
    Makoto Imase
    0 references
    Bernard M. Waxman
    0 references
    publication date
    25 June 1992
    0 references
    zbMATH Keywords
    multipoint routing
    0 references
    communication networks
    0 references
    Steiner tree problem
    0 references
    worst- case performance
    0 references
    polynomial time algorithm
    0 references

    Identifiers

    DOI
    10.1137/0404033
    0 references
    Mathematics Subject Classification ID
    05C05
    0 references
    68Q25
    0 references
    68M10
    0 references
    zbMATH DE Number
    14943
    0 references
    OpenAlex ID
    W2029437526
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3977293&oldid=32092381"
    Powered by MediaWiki