Welcome to CRCPress.com! We have customized the Taylor & Francis India website to host CRC Press titles. Please choose www.TandFIndia.com to get the following benefits:
South Asia Editions of CRC Press titles with INR prices
Multiple options to purchase locally
All CRC Press products available
Your CRC Press login credentials will work on TandFIndia.com
Garland Science Website Announcement
The Garland Science website is no longer available to access and you have been automatically redirected to CRCPress.com.
All instructor resources (*see Exceptions) are now available on our Instructor Hub. Your GarlandScience.com instructor credentials will not grant access to the Hub, but existing and new users may request access here.
The student resources previously accessed via GarlandScience.com are no longer available to existing or new users.
This book focuses on computation complexity and design of algorithms for multi-layer channel routing. In particular, it deals with various large-scale, computationally intensive optimization problems that have specific applications in many technology-supported routing models. The author includes numerous examples and exercises along with many hard-copy solutions that illustration the feasibility of different routing solutions. He also mentions several problems that remain open, pointing the way for future research.
Table of Contents
LITERATURE SURVEY Terminology and Definitions Two- and Three-Layer Routing is NP-Complete Algorithms for Channel Routing RESOLVING HORIZONTAL CONSTRAINTS IN MULTI-LAYER CHANNEL ROUTING Algorithms for Two-Layer Routing in the Absence of Vertical Constraints Multi-Layer Vi+1Hi Channel Routing A GENERAL FRAMEWORK FOR TRACK ASSIGNMENT IN MULTI-LAYER CHANNEL ROUTING Formulation of the Problem and the Algorithm Extensions of the TAH Framework to Other Problems COMPUTATIONAL COMPLEXITY OF WIRE LENGTH MINIMIZATION IN CHANNEL ROUTING Wire Length Minimization in Channel Routing NP-Completeness Results, Two- and Three-Layer No-Dogleg Routing NP-Completeness Results in Multi-Layer No-Dogleg Routing NP- Completeness Results in Multi-Layer Restricted Dogleg Routing ALGORITHMS FOR MINIMIZING WIRE LENGTH IN MULTI-LAYER CHANNEL ROUTING Algorithms for Minimizing Wire Length in Vi+1Hi Channel Routing Algorithm for Minimizing Wire Length in Two-Layer VH Channel Routing Algorithm for Minimizing Wire Length in Three-Layer HVH Channel Routing NOTE: Overviews/Conclusions begin and end each chapter
We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.
Most VitalSource eBooks are available in a reflowable EPUB format which allows you to resize text to suit you and enables other accessibility features. Where the content of the eBook requires a specific layout, or contains maths or other special characters, the eBook will be available in PDF (PBK) format, which cannot be reflowed. For both formats the functionality available will depend on how you access the ebook (via Bookshelf Online in your browser or via the Bookshelf app on your PC or mobile device).
CHOICE – Outstanding Academic Title – Award Winner
CHOICE – 2018 Outstanding Academic Title – Award Winner
Shingo Research and Professional Publication Award Winner
The country you have selected will result in the following:
Product pricing will be adjusted to match the corresponding currency.
The title will be removed from your cart because it is not available in this region.