A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325)

From MaRDI portal
Revision as of 18:21, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
scientific article

    Statements

    title
    A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    18 March 2010
    0 references
    zbMATH Keywords
    distributed algorithms
    0 references
    multicast routing
    0 references
    Steiner tree
    0 references
    describes a project that uses
    BRITE
    0 references
    SteinLib
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B80
    0 references
    90C35
    0 references
    90C59
    0 references
    zbMATH DE Number
    5682961
    0 references
    OpenAlex ID
    W2093592023
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2270325&oldid=38978239"
    Powered by MediaWiki