✦ LIBER ✦

Cost allocation for steiner trees

✍ Scribed by N. Megiddo

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 280 KB
Volume: 8
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230080104

No coin nor oath required. For personal study only.

✦ Synopsis

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 supplier is given by a minimal Steiner tree. An example is given in which for every allocation of the total cost of the tree to the consumers, a coalition of consumers exists, which is charged more than the cost required for connecting its members to the central supplier.

📜 SIMILAR VOLUMES

Cost allocation for a spanning tree

✍ A. Claus; D. J. Kleitman 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 770 KB

## 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.

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

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

Cut and patch Steiner trees for ladders

✍ Rainer E. Burkard; Tibor Dudás; Thomas Maier 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Balanced allocations for tree-like input

Balanced allocations for tree-like inputs

✍ Andrei Z Broder; Alan Frieze; Carsten Lund; Steven Phillips; Nick Reingold 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 373 KB

Probabilistic models for the Steiner Tre

Probabilistic models for the Steiner Tree problem

✍ Vangelis Th. Paschos; Orestis A. Telelis; Vassilis Zissimopoulos 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB