Automated placement and routing

Computer-Aided Design

Volumn 20, Issue 1, 1988, Pages 39-44

  Brown, A D ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

AUTOMATIC PLACEMENT AND ROUTING; CAD; GLOBAL ROUTING; ITERATIVE PLACEMENT; MASTERSLICE;

INTEGRATED CIRCUITS;

EID: 0023843330     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/0010-4485(88)90139-X     Document Type: Review

References (13)

1. VLSI and technical innovation
2. A min-cut placement algorithm for general cell assemblies based on a representation
3. The placement problem as viewed from the physics of classical mechanics
4. A combined force and cut algorithm for hierarchical VLSI layout
5. Automated placement of multi-terminal components
6. IC mask layout with a single conductor layer
7. Mathematical models for the circuit layout problem
8. Algorithms for the assignment and transportation problems
9. The Hungarian method for the assignment problem
10. An algorithm for path connections and its applications
11. A fast maze router
12. The Berkeley building block layout system for VLSI design