Please use this identifier to cite or link to this item:
For citation please use:
Main Title: Switchbox Routing in VLSI Design: Closing the Complexity Gap
Author(s): Hartmann, Stephan
Schäffter, Markus W.
Schulz, Andreas S.
Type: Research Paper
Abstract: The design of integrated circuits has achieved a great deal of attention in the last decade. In the routing phase, there have survived two open layout problems which are important from both the theoretical and the practical point of view. Up to now, switchbox routing has been known to be solvable in polynomial time when there are only 2-terminal nets, and to be NP}-complete in case there exist nets involving at least five terminals. Our main result is that this problem is NP}-complete even if no net has more that three terminals. Hence, from the theoretical perspective, the SRP is completely settled. The NP–completeness proof is based on a reduction from a special kind of the satisfiability problem. It is also possible to adopt our construction to channel routing which shows that this problem is NP–complete, even if each net does not consist of more than five terminals. This improves upon a result of Sarrafzadeh who proved the NP–completeness in case of nets with no more than six terminals.
Subject(s): VLSI design
complexity gap
switchbox routing
integrated circuits
Issue Date: 1996
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 1996, 500
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Format: Adobe PDF | Size: 153.1 kB
DownloadShow Preview
Format: Postscript | Size: 263.08 kB

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.