No label defined (Q4518929)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1538069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1538069 |
Statements
3 December 2000
0 references
computational complexity
0 references
design of algorithms
0 references
multi-layer channel routing
0 references
0.718203604221344
0 references
0.6967038512229919
0 references
0.6911489367485046
0 references
[The book is also available from Chapman \& Hall/CRC, ISBN 0-8493-0931-X] The book ``Multi-Layer Channel Routing Complexity and Algorithms'' of Rajat K. Pal focuses on computational complexity and design of algorithms for multi-layer channel routing. Many theoretical results on NP-hardness of routing problems and bounds on optimal solutions targeting minimum chip area and wire length are presented. In particular, it gives an excellent survey on the algorithms presented in literature till 1990. Although channel routing algorithms are fundamental for the understanding for the development of advanced routing paradigms, the availability of multiple metal layers obviates the need of channel routing. Furthermore, Rajat K. Pal only focuses on routing area and wire length as optimization goals in channel routing. Other goals, as e.g. power consumption and signal delay, which depends not only on wire length, are not considered in this book.
0 references