Fast and Near-Optimal Timing-Driven Cell Sizing under Cell Area and Leakage Power Constraints Using a Simplified Discrete Network Flow Algorithm

Table 1

Percentage timing improvements of max-flow heuristic and min-cost heuristic with different path length limits.

Ckt	Max flow	Min cost of length
		2	3	4	5
	%Δ𝑇	%Δ𝑇	%Δ𝑇	%Δ𝑇	%Δ𝑇
C432	8.4	10.0	11.9	12.2	12.2
C1355	4.2	6.0	6.8	6.9	7.2
C3540	12.9	16.1	16.8	17.0	17.1
C7552	8.3	9.3	9.9	10.3	10.5
Average	8.4	10.4	11.4	11.6	11.7