Via Minimization with Pin Preassignments and Layer Preferal

Reinelt, Gerhard and Jünger, Michael and Grötschel, Martin (1989) Via Minimization with Pin Preassignments and Layer Preferal.
Published in: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik Vol. 69 (11). pp. 393-399.

Abstract

The problem of minimizing the number of vias subject to pin preassignments and layer preferences comes up in VLSI respectively printed circuit board design. It can be formulated as a max-cut problem. In this paper, we discuss the application of approximative algorithms for the max-cut problem to minimize the number of vias of (real-world) electronic circuits.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: No citation data.
Uncontrolled Keywords:
Subjects:
  • 05-XX Combinatorics > 05Cxx Graph theory > 05C10 Planar graphs; geometric and topological aspects of graph theory

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C35 Extremal problems

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C85 Graph algorithms

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C35 Programming involving graphs or networks

  • 94-XX Information and communication, circuits > 94Cxx Circuits, networks > 94C15 Applications of graph theory

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Related URLs:
    Deposit Information:
    ZAIK Number: UNSPECIFIED
    Depositing User: Archive Admin
    Date Deposited: 31 Aug 2010 14:38
    Last Modified: 04 Jul 2014 09:30
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/812