Abstract
A zero-skew routing algorithm with clustering and improvement methods is proposed. This algorithmgenerates a zero-skew routing in O(n log n) time for n pins, and it is proven that the order ofthe total wire length is best possible. Our algorithm achieves 20% reduction of the total wire lengthand 15%-50% improvement of the delay time on benchmark data compared with the best knownalgorithm.1Department of Computer Science, Princeton University and C&C Systems Research Laboratories, NEC...