The complexity of the capacitated tree problem (Q3886877)

From MaRDI portal
Revision as of 23:03, 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
The complexity of the capacitated tree problem
scientific article

    Statements

    title
    The complexity of the capacitated tree problem (English)
    0 references
    published in
    Networks
    0 references
    publication date
    1978
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    94C15
    0 references
    05C05
    0 references
    zbMATH DE Number
    3692663
    0 references
    zbMATH Keywords
    capacitated tree problem
    0 references
    spanning tree
    0 references
    NP-complete
    0 references
    Euclidean capacitated tree problem
    0 references
    OpenAlex ID
    W1972674272
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3886877&oldid=32095961"
    Powered by MediaWiki