✦ LIBER ✦

Cost allocation for a spanning tree

✍ Scribed by A. Claus; D. J. Kleitman

Publisher: John Wiley and Sons
Year: 1973
Tongue: English
Weight: 770 KB
Volume: 3
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230030402

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On cost allocation for a spanning tree:

On cost allocation for a spanning tree: A game theoretic approach

✍ C. G. Bird 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

## Abstract Cooperative game theory solution concepts are used to allocate costs in a spanning tree network. Stable cost allocations are related to the core of a cooperative game and it is proved that every game generated from a minimum cost spanning tree with an immovable source has a core. A refi

Cost allocation for steiner trees

✍ N. Megiddo 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract A set of points, called consumers, and another point called central supplier, are located in a Euclidean plane. The cost of constructing a connection between two points is proportional to the distance between them. The minimum cost required for connecting all the consumers to the suppli

A network flow approach to cost allocati

A network flow approach to cost allocation for rooted trees

✍ Satoru Iwata; Nozomu Zuiki 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

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

Spanning trees in a cactus

✍ Y. Egawa; Preben Dahl Vestergaard 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 361 KB