✦ LIBER ✦

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

✍ Scribed by Ulrich Faigle; Walter Kern; Daniël Paulusma

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of testing membership

✍ Ulrich Faigle; Walter Kern; Sándor P. Fekete; Winfried Hochstättler 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 291 KB

Note Computing the nucleolus of min-cost

✍ Ulrich Faigle; Walter Kern; Jeroen Kuipers 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 153 KB