The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer case

DOI10.1109/TCS.1976.1084169zbMath0366.90071OpenAlexW2126234424MaRDI QIDQ4142998

Ernest S. Kuh, Benjamin S. Ting, Isao Shirakawa

Publication date: 1976

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcs.1976.1084169

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items

Multilayer grid embeddings for VLSI, A lower bound on the area of permutation layouts, Partitioning technique for transforming perfect binary trees into single-row networks, Double-row planar routing and permutation layout