✦ LIBER ✦

Minimum-cost spanning tree as a path-finding problem

✍ Scribed by Bruce M. Maggs; Serge A. Plotkin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum cost spanning tree problems with

✍ Gustavo Bergantiños; María Gómez-Rúa 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 473 KB

A fair rule in minimum cost spanning tre

✍ Gustavo Bergantiños; Juan J. Vidal-Puga 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 319 KB

The optimisticTUgame in minimum cost spa

✍ Gustavo Bergantiños; Juan J. Vidal-Puga 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

Merge-proofness in minimum cost spanning

✍ María Gómez-Rúa; Juan Vidal-Puga 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 328 KB

A cost allocation rule for -hop minimum

✍ G. Bergantiños; M. Gómez-Rúa; N. Llorca; M. Pulido; J. Sánchez-Soriano 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Approximating minimum-cost graph problem

✍ Michel X. Goemans; David P. Williamson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 435 KB