An improved linear placement algorithm using node compaction
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 15 (8) , 952-958
- https://doi.org/10.1109/43.511574
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Linear ordering by stochastic evolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Analytical approaches to the combinatorial optimization in linear placement problemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- A heuristic algorithm for ordering the columns in one-dimensional logica arraysIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- A heuristic standard cell placement algorithm using constrained multistage graph modelIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Linear placement algorithms and applications to VLSI designNetworks, 1987
- Optimization by Simulated AnnealingScience, 1983
- Linear Ordering and Application to PlacementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Suboptimum solution of the back-board ordering with channel capacity constraintIEEE Transactions on Circuits and Systems, 1977
- b-Matchings in TreesSIAM Journal on Computing, 1976
- Optimal backboard ordering through the shortest path algorithmIEEE Transactions on Circuits and Systems, 1974