VLSI routing in polynomial time

MaRDI QIDQ2816135zbMATH OpenFDO

Authors András Recski

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305801842?np=y

zbMATH Keywords

channel routingdetailed routingVLSI design

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 125488
• scientific article; zbMATH DE number 1264411
• Some polynomially solvable subcases of the detailed routing problem in VLSI design
• Shortest paths and Steiner trees in VLSI routing
• The VLSI Complexity of Selected Graph Problems
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
• Algorithms and Computation
• On routing in VLSI design and communication networks
• Global routing in VLSI design: algorithms, theory, and computational practice
• Routing in VLSI-layout

Cited in

(8)

• Switchbox routing in VLSI design: Closing the complexity gap
• A polynomial time algorithm for 2-layer channel routing problem
• scientific article; zbMATH DE number 125488 (Why is no real title available?)
• scientific article; zbMATH DE number 140495 (Why is no real title available?)
• scientific article; zbMATH DE number 1264411 (Why is no real title available?)
• Some polynomially solvable subcases of the detailed routing problem in VLSI design
• Switchbox routing in VLSI design: closing the complexity gap (extended abstract)
• On routing in VLSI design and communication networks

This page was built for publication: VLSI routing in polynomial time

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