%0 Journal Article %1 journals/mmor/FaigleKP00 %A Faigle, Ulrich %A Kern, Walter %A Paulusma, Daniël %D 2000 %J Math. Meth. of OR %K dblp %N 1 %P 23-38 %T Note on the computational complexity of least core concepts for min-cost spanning tree games. %U http://dblp.uni-trier.de/db/journals/mmor/mmor52.html#FaigleKP00 %V 52

@article{journals/mmor/FaigleKP00, added-at = {2012-06-27T00:00:00.000+0200}, author = {Faigle, Ulrich and Kern, Walter and Paulusma, Daniël}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/25d38f90e0534f1237078fab2a7f4f4c1/dblp}, ee = {http://dx.doi.org/10.1007/s001860000059}, interhash = {81a197e9a9f92d750d3568be87af070c}, intrahash = {5d38f90e0534f1237078fab2a7f4f4c1}, journal = {Math. Meth. of OR}, keywords = {dblp}, number = 1, pages = {23-38}, timestamp = {2016-02-02T02:18:43.000+0100}, title = {Note on the computational complexity of least core concepts for min-cost spanning tree games.}, url = {http://dblp.uni-trier.de/db/journals/mmor/mmor52.html#FaigleKP00}, volume = 52, year = 2000 }