𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A combinatorial approximation algorithm for concurrent flow problem and its application

✍ Scribed by Suh-Wen Chiou

Book ID
108105591
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
346 KB
Volume
32
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combinatorial Approximation Algorithms f
Combinatorial Approximation Algorithms for Generalized Flow Problems
✍ Jeffrey D Oldham πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier Β΅ v w for each arc v w . For every unit of flow entering the arc, Β΅ v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi

An approximate Aβˆ— algorithm and its appl
An approximate Aβˆ— algorithm and its application to the SCS problem
✍ Gaia Nicosia; Gianpaolo Oriolo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 123 KB

In this paper we deal with algorithm A \* and its application to the problem of ΓΏnding the shortest common supersequence of a set of sequences. A \* is a powerful search algorithm which may be used to carry out concurrently the construction of a network and the solution of a shortest path problem on