An algorithm for the via assignment problem in multilayer backboard wiring

DOI10.1109/TCS.1979.1084651MaRDI QIDQ4198670zbMATH OpenOpenAlexFDO

Authors Shuji Tsukiyama, Isao Shirakawa, Shigeo Asahara

Publication date 1979

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

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

zbMATH Keywords

computational complexitymultilayer backboard wiringpolynomial-time algorithmroutingvia assignment problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Large-scale systems (93A15) Applications of design theory to circuits and networks (94C30) Circuits, networks (94C99)

Recommendations

• scientific article; zbMATH DE number 4014616
• Constrained via minimization for three-layer routing
• Via Minimization with Pin Preassignments and Layer Preference
• A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization
• The complexity of single row routing

Cited in

(6)

• scientific article; zbMATH DE number 4014616 (Why is no real title available?)
• A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization
• Via Minimization with Pin Preassignments and Layer Preference
• An Approach to Gate Assignment and Module Placement for Printed Wiring Boards
• Performance driven \(k\)-layer wiring
• scientific article; zbMATH DE number 4185548 (Why is no real title available?)

This page was built for publication: An algorithm for the via assignment problem in multilayer backboard wiring

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