@book{e9c91b705eff4ac79bd07c7e5b635775,
title = "Note on the computational complexity of least core concepts for min-cost spanning tree games",
abstract = "Various least core concepts including the classical least core of cooperative games are discussed. By a reduction from minimum cover problems, we prove that computing an element in these least cores is in general $NP$-hard for minimum cost spanning tree games. As a consequence, computing the nucleolus, the nucleon and the per-capita nucleolus of minimum cost spanning tree games is also $NP$-hard.",
keywords = "EWI-3303, MSC-90C27, METIS-141273, IR-65672, MSC-90D12",
author = "U. Faigle and Walter Kern and Dani{\"e}l Paulusma",
note = "Imported from MEMORANDA",
year = "1999",
language = "Undefined",
isbn = "0169-2690",
series = "Memorandum / Faculty of Mathematical Sciences",
publisher = "University of Twente",
number = "1483",
address = "Netherlands",
}