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

From MaRDI portal
Revision as of 10:17, 10 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q170461)
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
    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=20411491"
    Powered by MediaWiki