| Practical Approximations of Steiner Trees in Uniform Orientation Metrics (2009) | |||||||||||||||
Abstract | |||||||||||||||
| The Steiner minimum tree problem, which asks for a minimum-length interconnection of a given set of termi-nals in the plane, is one of the fundamental problems in Very Large Scale Integration (VLSI) physical design. Although advances in VLSI manufacturing technologies have introduced additional routing objectives, mini-mum length continues to be the primary objective when routing non-critical nets, since the minimum-length | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||