Combinatorial Algorithms for Integrated Circuit Layout

✍ Scribed by Thomas Lengauer (auth.)

Publisher: Vieweg+Teubner Verlag
Year: 1992
Tongue: English
Leaves: 714
Series: Applicable Theory in Computer Science
Edition: 1
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

Das Buch steht im Rahmen des Projektes http://InterDoc.OFFIS.Uni-Oldenburg.de>InterDoc online zur Verfügung.

✦ Table of Contents

Front Matter....Pages i-xxviii
Front Matter....Pages 1-1
Introduction to Circuit Layout....Pages 3-29
Optimization Problems....Pages 31-45
Graph Algorithms....Pages 47-135
Operations Research and Statistics....Pages 137-217
Front Matter....Pages 219-219
The Layout Problem....Pages 221-250
Circuit Partitioning....Pages 251-301
Placement, Assignment, and Floorplanning....Pages 303-377
Global Routing and Area Routing....Pages 379-454
Detailed Routing....Pages 455-578
Compaction....Pages 579-647
Back Matter....Pages 649-697

✦ Subjects

Engineering, general

📜 SIMILAR VOLUMES

Layout Techniques for Integrated Circuit

📁 Layout Techniques for Integrated Circuit Designers

✍ Mikael Sahrling 📂 Library 📅 2022 🏛 Artech House 🌐 English

<span>This book provides complete step-by-step guidance on the physical implementation of modern integrated circuits, showing you their limitations and guiding you through their common remedies. The book describes today's manufacturing techniques and how they impact design rules. You will understand

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2005 🏛 Springer 🌐 English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2002 🏛 Springer 🌐 English

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte 📂 Library 📅 2012 🏛 Springer 🌐 English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This

Geometric Algorithms and Combinatorial O

📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)

✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin

Geometric Algorithms and Combinatorial O

📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)

✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English