An assignment algorithm with applications to integrated circuit layout

DOI10.1016/0166-218X(86)90064-8zbMath0583.90066MaRDI QIDQ1069442

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

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

Related Items (1)

Minimizing the density of terminal assignments in layout design

Cites Work

• Optimal Wiring of Movable Terminals
• Unnamed Item

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