Items related to Multi-Layer Channel Routing: Complexity and Algorithms
Synopsis
This in-depth study and investigation of channel routing using multiple layers of interconnection uses a large number of theorems and examples. Solutions are included to support the feasibility of different routing solutions. A large number of problems are included for future researchers.
Table of Contents
• Foreword
•
• Preface
• Introduction
• Literature Survey
• Resolving Horizontal Constraints in Multi-Layer Channel Routing
• A General Framework for Track Assignment in Multi-Layer Channel Routing
• Computational Complexity of Area Minimization in Multi-Layer Channel Routing and an Efficient Algorithm
• An Algorithm for Finding a Lower Bound on the Area of Routing
• Computational Complexity of Approximate Area Minimization in Channel Routing
• Computational Complexity of Wire Length Minimization in Channel Routing
• Algorithms for Minimizing Wire Length in Multi-Layer Channel Routing
• Summary, Related Fields of Research and Open Problems
• A. Channel Specifications
• B. Tables for Reduced Wire Length
• Bibliography
• Subject Index.
"synopsis" may belong to another edition of this title.
About the Author
Rajat K. Pal.: Department of Computer Sciences and Engineering, University of Calcutta, Calcutta, India
"About this title" may belong to another edition of this title.
- PublisherAlpha Science
- Publication date2000
- ISBN 10 1842650181
- ISBN 13 9781842650189
- BindingHardcover
- LanguageEnglish
- Number of pages418
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want