Computing the nucleolus of min-cost spanning tree games is NP-hard

U. Faigle, Walter Kern, Jeroen Kuipers

    Research output: Book/ReportReportProfessional

    Original languageUndefined
    Place of PublicationEnschede
    PublisherUniversiteit Twente
    Number of pages11
    ISBN (Print)0169-2690
    Publication statusPublished - 1997

    Keywords

    • METIS-141155

    Cite this

    Faigle, U., Kern, W., & Kuipers, J. (1997). Computing the nucleolus of min-cost spanning tree games is NP-hard. Enschede: Universiteit Twente.