Garg, Naveen ; Konemann, Jochen (2006) Faster and simpler algorithms for multicommodity flow and other fractional packing problems SIAM Journal on Computing, 37 (2). pp. 630-652. ISSN 0097-5397
Full text not available from this repository.
Official URL: http://epubs.siam.org/doi/abs/10.1137/S00975397044...
Related URL: http://dx.doi.org/10.1137/S0097539704446232
Abstract
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new, faster, and much simpler algorithms for these problems.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Society for Industrial and Applied Mathematics. |
| ID Code: | 101260 |
| Deposited On: | 31 Jan 2018 09:09 |
| Last Modified: | 31 Jan 2018 09:09 |
Repository Staff Only: item control page
