✦ LIBER ✦

Note Computing the nucleolus of min-cost spanning tree games is NP-hard

✍ Scribed by Ulrich Faigle; Walter Kern; Jeroen Kuipers

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on the computational complexity of

✍ Ulrich Faigle; Walter Kern; Daniël Paulusma 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 129 KB

On the complexity of testing membership

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