Meta-heuristics support managers in decision-making with robust tools that provide high-
quality solutions to important applications in business, engineering, economics and science …

This paper presents a comprehensive survey of existing techniques for interconnect
optimization during the VLSI physical design process, with emphasis on recent studies on …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Improved Steiner Tree Approximation in Graphs 1 Introduction Page 1 Improved Steiner Tree
Approximation in Graphs Gabriel Robins Alexander Zelikovskyy Abstract The Steiner tree …

VLSI is an important area of electronic and computer engineering. However, there are few
textbooks available for undergraduate/postgraduate study of VLSI design automation and …

The classical Steiner tree problem in weighted graphs seeks a minimum weight connected
subgraph containing a given subset of the vertices (terminals). We present a new polynomial …

The re-emerging interconnect problem is quickly becoming a major bottleneck to the
performance enhancement and cost reduction of modern digital systems. To overcome this …

In this paper, we study the interconnect design problem under a distributed RC delay model.
We study the impact of technology factors on the interconnect designs and present general …

A new approximation heuristic for finding a rectilinear Steiner tree of a set of nodes is
presented. It starts with a rectilinear minimum spanning tree of the nodes and repeatedly …

We study the minimum-cost bounded-skew routing tree problem under the pathlength
(linear) and Elmore delay models. This problem captures several engineering tradeoffs in …