Computing the nucleolus of min-cost spanning tree games is NP-hard. (Q1972596)

From MaRDI portal
Revision as of 17:38, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computing the nucleolus of min-cost spanning tree games is NP-hard.
scientific article

    Statements

    title
    Computing the nucleolus of min-cost spanning tree games is NP-hard. (English)
    0 references
    DOI
    10.1007/s001820050083
    0 references
    author
    Ulrich Faigle
    0 references
    Walter Kern
    0 references
    Jeroen Kuipers
    0 references
    publication date
    11 April 2000
    0 references
    zbMATH DE Number
    1429822
    0 references
    zbMATH Keywords
    \(N\) -person game
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1972596&oldid=14423657"
    Powered by MediaWiki