Optimal Wiring of Movable Terminals

DOI10.1109/TC.1983.1676333MaRDI QIDQ3043056zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1983.1676333

zbMATH Keywords

analysis of algorithmsmovable terminalsNP-complete problemsoptimal algorithmsVLSI chip designwiring channels

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Applications of graph theory to circuits and networks (94C15)

Cited in

(3)

• An assignment algorithm with applications to integrated circuit layout
• Distribution of the Minimum Channel Width in VLSI Wiring
• Minimizing channel density with movable terminals

This page was built for publication: Optimal Wiring of Movable Terminals

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