文章基本信息

标题：On the Complexity of Knock-knee Channel-Routing with 3-Terminal Nets
本地全文：下载
作者：Robert Albin Legenstein
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：In this article we consider a basic problem in the layout of VLSI-circuits, the channel-routing problem in the knock-knee mode. We show that knock-knee channel routing with 3-terminal nets is NP-complete and thereby settling a problem that was open for more than a decade. In 1987, Sarrafzadeh showed that knock-knee channel routing with 5-terminal nets is NP-complete. Furthermore, it is known that this problem is solvable in polynomial time if only 2-terminal nets are involved (This problem was addressed for example by Frank in 1982 and by Formann, D. Wagner, and F. Wagner in 1993).
关键词：channel routing , Computational Complexity , graph drawing , knock knee , VLSI