Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
An algorithm for the assignment problem
Communications of the ACM
The interchange algorithms for circuit placement problems
DAC '80 Proceedings of the 17th Design Automation Conference
An iterative algorithm for placement and assignment of integrated circuits
DAC '75 Proceedings of the 12th Design Automation Conference
VLSI cell placement techniques
ACM Computing Surveys (CSUR)
A grid-based approach for connectivity binding with geometric costs
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Accurate net models for placement improvement by network flow methods
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Automatic placement a review of current techniques (tutorial session)
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Automatic intra-device pin & element reassignment (AIDPER) algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Engineering a scalable placement heuristic for DNA probe arrays
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
On legalization of row-based placements
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Evaluation of Placement Techniques for DNA Probe Array Layout
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
This paper examines the application of the computationally powerful linear assignment algorithm to the placement problem. A brief description of the algorithm is given, followed by a discussion of its use with various problem constraints, for improving existing placements, and in a constructive-initial placement procedure. Several examples are included.