Faster approximation algorithm for generalized maximum concurrent flow problem with budget constraint

We present fully polynomial approximation algorithm for generalized maximum concurrent flow problem with budget constraint that run in time independent of the number of commodities k. We show that by modifying the algorithms by Karakostas and Fleischer. We can reduce their running time. At the same ... View More