Koenemann, J. ; Garg, N. (1998) Faster and simpler algorithms for multicommodity flow and other fractional packing problems In: Proceedings of thr 39th Annual Symposium on Foundations of Computer Science,, November 08-11, 1998, Palo Alto, CA, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/743463/
Abstract
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min-cost multicommodity flow; this yields much faster algorithms when the number of commodities is large.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| Keywords: | Concurrent Computing; Throughput; Computer Science; Design Engineering; Polynomials |
| ID Code: | 101324 |
| Deposited On: | 31 Jan 2018 09:34 |
| Last Modified: | 31 Jan 2018 09:34 |
Repository Staff Only: item control page
