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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.