The Faculty of Mathematics and Natural Sciences: Search
Now showing items 1-2 of 2
Efficient Algorithms for Routing a Net Subject to VLSI Design Rules
(2020-12-17)
In this thesis we consider detailed routing, an important step in the design of integrated circuits. On large instances detailed routing requires packing millions of node-disjoint Steiner trees into a graph with hundreds ......
Dynamic Local Usage in BonnRouteGlobal
(2023-12-14)
In this dissertation we consider the global routing problem which is a central task in chip design. Up to millions of sets of pins on a chip, so called nets, have to be connected through wires without intersecting each ...




