Switchbox routing in VLSI design: Closing the complexity gap

DOI10.1016/S0304-3975(97)00286-7zbMath0913.68101OpenAlexW1849307453MaRDI QIDQ1274317

Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00286-7

zbMATH Keywords

VLSI designNP-completenessswitchbox routingSteiner tree packing

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computer system organization (68M99)

Cites Work

• Multicommodity flows in planar graphs
• Routing through a Dense Channel with Minimum Total Wire Length
• Routing in grid graphs by cutting planes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Switchbox routing in VLSI design: Closing the complexity gap