The Faculty of Mathematics and Natural Sciences: Search
Now showing items 1-2 of 2
Approximation Complexity of Optimization Problems: Structural Foundations and Steiner Tree Problems
(2004)
In this thesis we study the approximation complexity of the Steiner Tree Problem and related problems as well as foundations in structural complexity theory. The Steiner Tree Problem is one of the most fundamental problems ...
Transistor-Level Layout of Integrated Circuits
(2014-07-29)
In this dissertation, we present the toolchain BonnCell and its underlying algorithms. It has been developed in close cooperation with the IBM Corporation and automatically generates the geometry for functional groups of ...