✦ LIBER ✦

A cost allocation rule for -hop minimum cost spanning tree problems

✍ Scribed by G. Bergantiños; M. Gómez-Rúa; N. Llorca; M. Pulido; J. Sánchez-Soriano

Book ID: 113834597
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 260 KB
Volume: 40
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2011.11.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fair rule in minimum cost spanning tre

A fair rule in minimum cost spanning tree problems

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

On obligation rules for minimum cost spa

On obligation rules for minimum cost spanning tree problems

✍ Gustavo Bergantiños; Anirban Kar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Sequential contributions rules for minim

Sequential contributions rules for minimum cost spanning tree problems

✍ Youngsub Chun; Joosung Lee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Cost allocation for a spanning tree

✍ A. Claus; D. J. Kleitman 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 770 KB

## Abstract The problem of allocating cost in a spanning tree network is considered. A number of possible schemes are surveyed, and critically analyzed. Methods are suggested that are preferred given different emphases among the criteria for such a function.

Minimum cost spanning tree problems with

Minimum cost spanning tree problems with groups

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

A characterization of Kruskal sharing ru

A characterization of Kruskal sharing rules for minimum cost spanning tree problems

✍ Leticia Lorenzo; Silvia Lorenzo-Freire 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 296 KB