𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum spanning tree with hop restrictions

✍ Scribed by Refael Hassin; Asaf Levin

Book ID
108421627
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
185 KB
Volume
48
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating k-hop minimum-spanning tre
Approximating k-hop minimum-spanning trees
✍ Ernst Althaus; Stefan Funke; Sariel Har-Peled; Jochen Könemann; Edgar A. Ramos; 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 231 KB
Minimum restricted diameter spanning tre
Minimum restricted diameter spanning trees
✍ Refael Hassin; Asaf Levin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Let G = (V; E) be a requirement graph. Let d = (dij) n i; j=1 be a length metric. For a tree T denote by dT (i; j) the distance between i and j in T (the length according to d of the unique i -j path in T ). The restricted diameter of T , DT , is the maximum distance in T between pair of vertices wi

Noncooperative cost spanning tree games
Noncooperative cost spanning tree games with budget restrictions
✍ Gustavo Bergantiños; Leticia Lorenzo 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract We extend the noncooperative game associated with the cost spanning tree problem introduced by Bergantiños and Lorenzo (Math Method Oper Res 59(2004), 393–403) to situations where agents have budget restrictions. We study the Nash equilibria, subgame perfect Nash equilibria, and strong