Optimal Wiring of Movable Terminals
From MaRDI portal
Publication:3043056
DOI10.1109/TC.1983.1676333zbMath0526.94023OpenAlexW1842919635MaRDI QIDQ3043056
No author found.
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
analysis of algorithmsNP-complete problemsoptimal algorithmsVLSI chip designmovable terminalswiring channels
Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Applications of graph theory to circuits and networks (94C15)
Related Items (3)
Minimizing channel density with movable terminals ⋮ Distribution of the Minimum Channel Width in VLSI Wiring ⋮ An assignment algorithm with applications to integrated circuit layout
This page was built for publication: Optimal Wiring of Movable Terminals