๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Balanced allocations for tree-like inputs

โœ Scribed by Andrei Z Broder; Alan Frieze; Carsten Lund; Steven Phillips; Nick Reingold

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
373 KB
Volume
55
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Cost allocation for steiner trees
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

Cost allocation for a spanning tree
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.

An Algorithm for Finding the K-Best Allo
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program
โœ A. Billionnet; S. Elloumi ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 592 KB

We consider the problem of allocating \(n\) tasks of a distributed program to \(m\) processors of a distributed system in order to minimize total communication and processing costs. If the intertask communication can be represented by a tree and if the communication costs are uniform, it is known th