Ulrich Faigle, Walter Kern, Daniël Paulusma. Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Meth. of OR, 52(1):23-38, 2000. [doi]
@article{FaigleKP00,
title = {Note on the computational complexity of least core concepts for min-cost spanning tree games},
author = {Ulrich Faigle and Walter Kern and Daniël Paulusma},
year = {2000},
doi = {10.1007/s001860000059},
url = {http://dx.doi.org/10.1007/s001860000059},
researchr = {https://researchr.org/publication/FaigleKP00},
cites = {0},
citedby = {0},
journal = {Math. Meth. of OR},
volume = {52},
number = {1},
pages = {23-38},
}