Skip to main content
SpringerLink
Log in

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

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

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract.

We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The proof uses a reduction from minimum cover problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands (e-mail: faigle@math.utwente.nl; kern@math.utwente.nl), , , , , , NL

    Ulrich Faigle & Walter Kern

  2. Instituto de Economia Publica, Universidad del Pais Vasco, Avda. Lehen-Dakari Aguirre 83, E-48015 Bilbao, Spain (e-mail: jk@bl.ehu.es), , , , , , ES

    Jeroen Kuipers

Authors
  1. Ulrich Faigle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Kern
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeroen Kuipers
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received October 1997/Final version May 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faigle, U., Kern, W. & Kuipers, J. Note Computing the nucleolus of min-cost spanning tree games is NP-hard. Game Theory 27, 443–450 (1998). https://doi.org/10.1007/s001820050083

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001820050083

Search

Navigation