448 search results - page 3 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
ICALP
2003
Springer
14 years 21 days ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
NETWORKS
2008
13 years 7 months ago
2008
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
TALG
2008
13 years 7 months ago
2008
INFORMS
2006
13 years 7 months ago
2006
ESA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...