Index Terms
- Flow
Recommendations
Group flow, complex flow, unit vector flow, and the (2+∈)-flow conjecture
If F is a (possibly infinite) subset of an abelian group @C, then we define f(F,@C) as the smallest natural number such that every f(F,@C)-edge-connected (finite) graph G has a flow where all flow values are elements in F. We prove that f(F,@C) exists ...
Fast Approximation Algorithms for Multicommodity Flow Problems
All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms uses a fast matrix multiplication algorithm and takes O(k3.5n3m0.5 log(nDU)) time for the ...
The k-Splittable Flow Problem
In traditional multi-commodity flow theory, the task is to send a certain amount of each commodity from its start to its target node, subject to capacity constraints on the edges. However, no restriction is imposed on the number of paths used for ...
Comments