Definition and algorithms for reliable Steiner tree problem (Q498083)

From MaRDI portal
Revision as of 20:25, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Definition and algorithms for reliable Steiner tree problem
scientific article

    Statements

    title
    Definition and algorithms for reliable Steiner tree problem (English)
    0 references
    author
    Yaohua Tang
    0 references
    Wenguo Yang
    0 references
    Tian-de Guo
    0 references
    publication date
    25 September 2015
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C05
    0 references
    68W25
    0 references
    zbMATH DE Number
    6485585
    0 references
    zbMATH Keywords
    approximation algorithm
    0 references
    exact algorithm
    0 references
    reliability
    0 references
    Steiner tree
    0 references
    OpenAlex ID
    W2044301172
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q498083&oldid=36202847"
    Powered by MediaWiki