A Clustering-Based Optimization Algorithm in Zero-Skew Routings
A zero-skew routing algorithm with clustering and improvement methods
is proposed. This algorithm generates a zero-skew routing in O(n log n)
time for n pins, and it is proven that the order of the total wire length
is best possible. Our algorithm achieves 20% reduction of the total wire
length and 15%-50% improvement of the delay time on benchmark data
compared with the best known algorithm.