Results 11  20
of
621
Fast Approximation Algorithms for Multicommodity Flow Problems
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1991
"... All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [15] uses a fast matrix multiplication algorithm and takes O(k 3:5 n 3 m :5 log(nDU )) time for the multicommodity flow problem with inte ..."
Abstract

Cited by 191 (21 self)
 Add to MetaCart
All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [15] uses a fast matrix multiplication algorithm and takes O(k 3:5 n 3 m :5 log(nDU )) time for the multicommodity flow problem
The Quickest Multicommodity Flow Problem
 INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
, 2002
"... Traditionally, ows over time are solved in timeexpanded networks which contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic toolbox developed for static ows, its main and often fatal drawback is the enormous size of the tim ..."
Abstract

Cited by 34 (11 self)
 Add to MetaCart
Traditionally, ows over time are solved in timeexpanded networks which contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic toolbox developed for static ows, its main and often fatal drawback is the enormous size of the timeexpanded network. In particular, this approach usually does not lead to efficient algorithms with running time polynomial in the input size since the size of the timeexpanded network is only pseudopolynomial. We present two
Multicommodity flow and circuit switching
 Proceedings of the Hawaii International Conference on System Sciences
, 1998
"... ..."
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
, 1999
"... We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the ru ..."
Abstract

Cited by 110 (8 self)
 Add to MetaCart
We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon
Multicommodity Flows Handout
, 2007
"... In the traditional (s, t) flow setting, we want to push as many units of a single resource, or commodity, from the source s to the sink t. Upon generalizing to the case of multiple commodities, we introduce a set of pairs (si, ti), i ∈ [n], which act as the sources and sinks of n simultaneous flows. ..."
Abstract
 Add to MetaCart
In the traditional (s, t) flow setting, we want to push as many units of a single resource, or commodity, from the source s to the sink t. Upon generalizing to the case of multiple commodities, we introduce a set of pairs (si, ti), i ∈ [n], which act as the sources and sinks of n simultaneous flows
Results 11  20
of
621