On the complexity of an optimal routing tree problem (Q1123140)

From MaRDI portal
Revision as of 10:50, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of an optimal routing tree problem
scientific article

    Statements

    title
    On the complexity of an optimal routing tree problem (English)
    0 references
    publication date
    1989
    0 references
    zbMATH Keywords
    set packing
    0 references
    routing tree
    0 references
    decision tree
    0 references
    minimum cost
    0 references
    NP-complete
    0 references
    author
    Ding-Zhu Du
    0 references
    Ker-I. Ko
    0 references

    Identifiers

    DOI
    10.1007/BF02006188
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    68Q25
    0 references
    05C05
    0 references
    90B35
    0 references
    05C70
    0 references
    zbMATH DE Number
    4108532
    0 references
    OpenAlex ID
    W2016093718
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1123140&oldid=37352225"
    Powered by MediaWiki