Note on the computational complexity of least core concepts for min-cost spanning tree games

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]

Authors

Ulrich Faigle

This author has not been identified. Look up 'Ulrich Faigle' in Google

Walter Kern

This author has not been identified. Look up 'Walter Kern' in Google

Daniël Paulusma

This author has not been identified. Look up 'Daniël Paulusma' in Google