𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The multiroute maximum flow problem revisited

✍ Scribed by Donglei Du; R. Chandrasekaran

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
283 KB
Volume
47
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On multiroute maximum flows in networks
On multiroute maximum flows in networks
✍ Charu C. Aggarwal; James B. Orlin πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 172 KB

## Abstract Let __G__ = (__N, A__) be a network with a designated source node __s__, a designated sink node __t__, and a finite integral capacity __u~ij~__ on each arc (__i, j__) ∈ __A__. An elementary __K__‐flow is a flow of __K__ units from __s__ to __t__ such that the flow on each arcis 0 or 1.

The eponym problem revisited
The eponym problem revisited
✍ Claude H. Organ Jr. πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 54 KB
The Automorphism Tower Problem Revisited
The Automorphism Tower Problem Revisited
✍ Winfried Just; Saharon Shelah; Simon Thomas πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 236 KB

It is well known that the automorphism towers of infinite centreless groups of cardinality } terminate in less than (2 } ) + steps. But an easy counting argument shows that (2 } ) + is not the best possible bound. However, in this paper, we will show that it is impossible to find an explicit better

The Optimal Alphabetic Tree Problem Revi
The Optimal Alphabetic Tree Problem Revisited
✍ Lawrence L Larmore; Teresa M Przytycka πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 202 KB

The Optimal Alphabetic Binary Tree OABT problem is equivalent to the Optimal Binary Search Tree problem where the weights are associated only with Ε½ . the leaves. The problem can be solved in O n log n time, while the best known Ε½ . lower bound is ⍀ n . In this paper we relate the complexity of the