An assignment algorithm with applications to integrated circuit layout

DOI10.1016/0166-218X(86)90064-8MaRDI QIDQ1069442zbMATH OpenFDO

Authors Mikhail J. Atallah, Susanne E. Hambrusch

Publication date 1986

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationdata structuresoptimal solutionminimum density2- terminal one-to-any problem2-color one-to-any problemchannel routing problemdesign of layout systemsterminal assignments

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 49142
• Algorithms for assignment problems on an array processor
• A graph-theoretic approach to the IC layout resizing problem
• scientific article; zbMATH DE number 3852448
• scientific article; zbMATH DE number 3959289
• A framework for solving VLSI graph layout problems
• Linear placement algorithms and applications to VLSI design
• Algorithms for VLSI placement
• scientific article; zbMATH DE number 3922544
• An algorithm for the assignment problem

Cites work

• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• Optimal Wiring of Movable Terminals

Cited in

(5)

• scientific article; zbMATH DE number 54185 (Why is no real title available?)
• An algorithm for assigning multiplexer inputs
• scientific article; zbMATH DE number 4014616 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• Minimizing the density of terminal assignments in layout design

This page was built for publication: An assignment algorithm with applications to integrated circuit layout

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069442)