On the minimum routing cost clustered tree problem (Q2359809)

From MaRDI portal
Revision as of 01:08, 14 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
On the minimum routing cost clustered tree problem
scientific article

    Statements

    title
    On the minimum routing cost clustered tree problem (English)
    0 references
    author
    Chen-Wan Lin
    0 references
    Bang Ye Wu
    0 references
    publication date
    22 June 2017
    0 references
    zbMATH DE Number
    6734729
    0 references
    zbMATH Keywords
    approximation algorithm
    0 references
    NP-hard
    0 references
    spanning tree
    0 references
    graph algorithm
    0 references
    OpenAlex ID
    W2373493542
    0 references
    cites work
    Q2747613
    0 references
    Q4198056
    0 references
    The checkpoint problem
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2359809&oldid=36329401"
    Powered by MediaWiki