Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14223
For citation please use:
Main Title: On the NP-Completeness of Channel and Switchbox Routing Problems
Author(s): Hartmann, Stephan
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15450
http://dx.doi.org/10.14279/depositonce-14223
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: The design of integrated circuits has achieved a great deal of attention in the last decade. In the routing phase, an open layout problem has survived which is important from both the theoretical and the practical point of view. The channel routing problem has been known to be solvable in polynomial time when there are only 2–terminal nets, and is proved by Sarrafzadeh to be NP–complete in case that there exists nets containing at least six terminals. Also the 5–terminal case is claimed to be NP–complete. In our paper, we give a simple proof for the NP–completeness of the 5–terminal channel routing problem. This proof is based on a reduction from a special version of the satisfiability problem. Based on the techniques introduced in this paper and a result of [HSS97] stating the NP–completeness of the 3–terminal switchbox routing problem, we prove the 4–terminal 3–sided switchbox routing problem to be NP–complete.
Subject(s): NP-complete
routing
5–terminal
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, 542
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:
Report-542-1996.pdf
Format: Adobe PDF | Size: 239.3 kB
DownloadShow Preview
Thumbnail
Report-542-1996.ps
Format: Postscript | Size: 217.58 kB
Download

Item Export Bar

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