𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Restricted Trees: Simplifying Networks with

✍ Scribed by Stephen J. Willson

Publisher
Springer
Year
2011
Tongue
English
Weight
570 KB
Volume
73
Category
Article
ISSN
1522-9602

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximating Steiner trees in graphs wi
Approximating Steiner trees in graphs with restricted weights
✍ HalldοΏ½rsson, MagnοΏ½s M.; Ueno, Shuichi; Nakao, Hiroshi; Kajitani, Yoji πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 128 KB πŸ‘ 2 views

We analyze the approximation ratio of the average distance heuristic for the Steiner tree problem on graphs and prove nearly tight bounds for the cases of complete graphs with binary weights {1, d} or weights in the interval [1, d], where d Β°2. The improvement over other analyzed algorithms is a fac

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