### Table 1 Number of times that Max-Flow is executed in c = 1 and c = 2 passes in CutMap.

1995

"... In PAGE 12: ... We evaluate the impact of applying Theorem 2 in the optimal min-cost K-feasible cut algorithm by reporting number of times that max-flow routine is executed in c = 1 and c = 2 passes. Table1 shows the numbers reported by CutMap for six small benchmarks. Numbers in row I and II are the numbers reported by CutMap without and with applying Theorem 2 for speed-up, respectively.... ..."

### TABLE II: MIN-COST VERSUS ITERATIVE MAX-FLOW MINIMUM REGISTER RETIMING ON LARGE ARTIFICIAL BENCHMARKS

### TABLE 2: MIN-COST VERSUS ITERATIVE MAX-FLOW MINIMUM REGISTER RETIMING ON LARGE ARTIFICIAL BENCHMARKS

### Table 2. Fraction of blocks read in each zone for the block-based max-flow and the time-based LP matching algorithm. The last column shows the improvement of the time-based approach.

in Load Balancing for Redundant Storage Strategies - Multiprocessor scheduling with machine eligibility

"... In PAGE 10: ... As the block-based max-flow algorithm does not take the transfer times into account we can expect that for that case the fraction of each zone follows exactly the percentage of the total disk capacity of that zone. Table2... ..."

Cited by 1

### Table 1: Comparison of Analytical and Simulation Results For Triangular Peak Max.flow rate Max. Delay in Simulation Deterministic Approx. %Difference Stochastic Approx. % Difference

"... In PAGE 6: ... In addition, Figure 3(b) compares the deterministic approximation results with those obtained through a simulation study with Poisson arrivals and exponential process times. As shown in Table1 deterministic approximations are very accurate at typical peak flow levels in airport terminals. In almost all instances, the differences from simulation results are within 10%.... ..."