Switchbox routing in VLSI design: closing the complexity gap (extended abstract)

DOI10.1007/3-540-62559-3_17zbMath1539.68222MaRDI QIDQ6550545

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

Publication date: 5 June 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Multicommodity flows in planar graphs
• Routing through a Dense Channel with Minimum Total Wire Length
• 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 (extended abstract)