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

This paper presents a comprehensive survey on global routing research over about the last
two decades, with an emphasis on the problems of simultaneously routing multiple nets in …

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

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 …

We study online learning algorithms that predict by combining the predictions of severrd
subordinate prediction algorithms, sometimes crdled “experts.“These simple algorithms …

The Steiner tree problem asks for the shortest tree connecting a given set of terminal points
in a metric space. We design new approximation algorithms for the Steiner tree problems …

Deep learning has improved state-of-the-art results in many important fields, and has been
the subject of much research in recent years, leading to the development of several systems …

The Minimal Exposure Problem (MEP), which corresponds to the quality of coverage, is a
fundamental problem in wireless sensor networks. This paper exploits a biological model of …

From the Publisher: This text treats the physical design of very large scale integrated circuits
gradually and systematically. It examines the design problem and the design process with …

As the integrated circuits (ICs) are scaled into nanometer dimensions and operate in
gigahertz frequencies, interconnects have become critical in determining system …