Approximation algorithms for priority Steiner tree problems (Q2695278)

From MaRDI portal
Revision as of 03:47, 20 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
Approximation algorithms for priority Steiner tree problems
scientific article

    Statements

    title
    Approximation algorithms for priority Steiner tree problems (English)
    0 references
    author
    Faryad Darabi Sahneh
    0 references
    Stephen G. Kobourov
    0 references
    Richard Spence
    0 references
    publication date
    30 March 2023
    0 references
    zbMATH DE Number
    7670456
    0 references
    zbMATH Keywords
    priority Steiner tree
    0 references
    approximation algorithms
    0 references
    network design
    0 references
    OpenAlex ID
    W3210324533
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2695278&oldid=33070466"
    Powered by MediaWiki