Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14223
For citation please use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHartmann, Stephan
dc.date.accessioned2021-12-17T10:05:06Z-
dc.date.available2021-12-17T10:05:06Z-
dc.date.issued1996
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15450-
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14223-
dc.description.abstractThe 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.en
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherNP-completeen
dc.subject.otherroutingen
dc.subject.other5–terminalen
dc.titleOn the NP-Completeness of Channel and Switchbox Routing Problemsen
dc.typeResearch Paperen
tub.accessrights.dnbfreeen
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber1996, 542en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
dc.type.versionsubmittedVersionen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften » Inst. Mathematikde
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.