b'@online{DarwishMehlhorn2015,'b'\nTITLE = {Improved Balanced Flow Computation Using Parametric Flow},\nAUTHOR = {Darwish, Omar and Mehlhorn, Kurt},\nLANGUAGE = {eng},\nURL = {http://arxiv.org/abs/1512.05974},\nEPRINT = {1512.05974},\nEPRINTTYPE = {arXiv},\nYEAR = {2015},\nABSTRACT = {We present a new algorithm for computing balanced flows in equality networks arising in market equilibrium computations. The current best time bound for computing balanced flows in such networks requires $O(n)$ maxflow computations, where $n$ is the number of nodes in the network [Devanur et al. 2008]. Our algorithm requires only a single parametric flow computation. The best algorithm for computing parametric flows [Gallo et al. 1989] is only by a logarithmic factor slower than the best algorithms for computing maxflows. Hence, the running time of the algorithms in [Devanur et al. 2008] and [Duan and Mehlhorn 2015] for computing market equilibria in linear Fisher and Arrow-Debreu markets improve by almost a factor of $n$.},\n}\n'