Overview: .On Optimal Interconnections for VLSI. describes, from ageometric perspective, algorithms for high-performance, high-densityinterconnections during the global and detailed routing phases ofcircuit layout. First, the book addresses area minimization, with afocus on near-optimal approximation algorithms for minimum-costSteiner routing. In addition to practical implementations of recentmethods, the implications of recent results on spanning tree degreebounds and the method of Zelikovsky are discussed. Second, the bookaddresses delay minimization, starting with a discussion of accurate,y
|