On Optimal Interconnections for VLSI

On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high—performance, high—density interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area minimization, with a focus on near—optimal approximation algorithms for minimum—cost Steiner routing. In addition to practical implementations of recent methods, the implications of recent results on spanning tree degree bounds and the method of Zelikovsky a...