𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum cost spanning tree games

✍ Scribed by Daniel Granot; Gur Huberman

Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
651 KB
Volume
21
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Improving Minimum Cost Spanning Trees by
Improving Minimum Cost Spanning Trees by Upgrading Nodes
✍ S.O Krumke; M.V Marathe; H Noltemeier; R Ravi; S.S Ravi; R Sundaram; H.-C Wirth πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 222 KB

Ž O O Žlog log n. . 2. In contrast, we show that, unless NP : DTIME n , there can be no polynomial time approximation algorithm for the problem that produces a solution with upgrading cost at most ␣ln n times the optimal upgrading cost Ž . even if the budget can be violated by a factor f n , for any

The Capacitated Minimum Spanning Tree
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