The parametric maximum flow problem is a generalization of the ordinary max- imum flow problem in which the capacities of arcs out of the source (into the sink) ...
We describe the results of an experimental study comparing the performance of the balancing algorithm, the GGT algorithm, and a simplified version of the GGT ...
This work defines two conditions on parametrized arc capacities that are necessary and sufficient for (strictly) decreasing differences of the parametric ...
Jun 2, 2006 · This algorithm uses a clever recursion to amortize a parametric flow computation over a push-relabel maximum flow computation and matches the O( ...
Recently Zhang et al. [14,13] proposed a novel, simple balancing algorithm for the parametric problem on bipartite networks. They claimed good performance for ...
... The team developed a new, efficient, and exact algorithm to solve the parametric maximum-flow problem (Tarjan et al. 2006, Zhang et al. 2004, 2005a, 2005b.
Dive into the research topics of 'Experimental evaluation of parametric max-flow algorithms'. Together they form a unique fingerprint. World Application ...
We describe the results of an experimental study comparing the performance of the balancing algorithm, the GGT algorithm, and a simplified version of the GGT ...
An efficient implementation of the parametric flow algorithm of Gallo, Grigoriadis, and Tarjan is described and it is compared with a simpler algorithm.
We describe the results of an experimental study comparing the performance of the balancing algorithm, the GGT algorithm, and a simplified version of the GGT ...