42 search results - page 1 / 9 » A Simple Local-Control Approximation Algorithm for Multicomm... |
FOCS
1993
IEEE
13 years 10 months ago
1993
IEEE
NETWORKS
2008
13 years 6 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...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
TAMC
2009
Springer
14 years 16 days ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
MOR
2000
13 years 5 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...