✦ LIBER ✦

The Stackelberg Minimum Spanning Tree Game

✍ Scribed by Jean Cardinal; Erik D. Demaine; Samuel Fiorini; Gwenaël Joret; Stefan Langerman; Ilan Newman; Oren Weimann

Book ID: 106149020
Publisher: Springer
Year: 2009
Tongue: English
Weight: 430 KB
Volume: 59
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-009-9299-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Stackelberg minimum spanning tree ga

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

✍ Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 917 KB

Minimum cost spanning tree games

✍ Daniel Granot; Gur Huberman 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 651 KB

Minimum spanning tree

✍ Cahit, I.; Cahit, R. 📂 Article 📅 1975 🏛 Institution of Electrical Engineers ⚖ 138 KB

The irreducible Core of a minimum cost s

The irreducible Core of a minimum cost spanning tree game

✍ Harry Aarts; Theo Driessen 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 606 KB

Minimum cost spanning tree games and spi

Minimum cost spanning tree games and spillover stability

✍ Ruud Hendrickx, Jacco Thijssen, Peter Borm 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 149 KB

The Capacitated Minimum Spanning Tree

✍ K. M. Chandy; Tachen Lo 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract The capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorith