This paper introduces and demonstrates an extension to quadratic placement that accounts for wiring congestion. The algorithm uses an A *  router and line-probe heuristics on region-based routing graphs to compute routing cost. The interplay between routing analysis and quadratic placement using a growth matrix permits global treatment of congestion. Further reduction in congestion is obtained by the relaxation of pin constraints. Experiments show improvements in wireability.
['Phiroze N. Parakh', 'Richard B. Brown', 'Karem A. Sakallah']
Congestion driven quadratic placement