Advertisement

Combinatorial Algorithms for Integrated Circuit Layout

  • Thomas Lengauer

Part of the Applicable Theory in Computer Science book series

Table of contents

  1. Front Matter
    Pages i-xxviii
  2. Background

    1. Front Matter
      Pages 1-1
    2. Thomas Lengauer
      Pages 3-29
    3. Thomas Lengauer
      Pages 31-45
    4. Thomas Lengauer
      Pages 47-135
    5. Thomas Lengauer
      Pages 137-217
  3. Combinatorial Layout Problems

    1. Front Matter
      Pages 219-219
    2. Thomas Lengauer
      Pages 221-250
    3. Thomas Lengauer
      Pages 251-301
    4. Thomas Lengauer
      Pages 303-377
    5. Thomas Lengauer
      Pages 379-454
    6. Thomas Lengauer
      Pages 455-578
    7. Thomas Lengauer
      Pages 579-647
  4. Back Matter
    Pages 649-697

About this book

Introduction

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

Keywords

Quicksort algorithms approximation algorithm complexity computer data structure depth-first search derivative design dynamic programming graph algorithm linear optimization modeling programming randomized algorithm

Authors and affiliations

  • Thomas Lengauer
    • 1
  1. 1.University of PaderbornPaderbornWest Germany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-322-92106-2
  • Copyright Information Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH, Wiesbaden 1992
  • Publisher Name Vieweg+Teubner Verlag
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-322-92108-6
  • Online ISBN 978-3-322-92106-2
  • Buy this book on publisher's site
Industry Sectors
Pharma
Materials & Steel
Automotive
Chemical Manufacturing
Biotechnology
Finance, Business & Banking
Electronics
Consumer Packaged Goods
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences
Engineering