A polynomial time algorithm for 2-layer channel routing problem

MaRDI QIDQ2829769zbMATH OpenFDO

Authors Xianya Geng

Publication date 8 November 2016

Published in International Journal of Applied Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL http://www.ceser.in/ceserp/index.php/ijamas/article/view/675

zbMATH Keywords

channel routingManhattan modelVLSI

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• Some polynomially solvable subcases of the detailed routing problem in VLSI design
• VLSI routing in polynomial time
• scientific article; zbMATH DE number 4077133
• scientific article; zbMATH DE number 1264411
• An algorithm for routing problems with given horizontal constraint graph

Cited in

(5)

• A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
• scientific article; zbMATH DE number 3907789 (Why is no real title available?)
• scientific article; zbMATH DE number 1264411 (Why is no real title available?)
• scientific article; zbMATH DE number 1737291 (Why is no real title available?)
• Some polynomially solvable subcases of the detailed routing problem in VLSI design

This page was built for publication: A polynomial time algorithm for 2-layer channel routing problem

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