Channel routing of multiterminal nets

DOI10.1145/179812.179927zbMath0812.68083OpenAlexW2153608026MaRDI QIDQ4310845

Michael Kaufmann, Shaodi Gao

Publication date: 20 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/179812.179927

zbMATH Keywords

VLSI layoutchannel routing of multiterminal nets

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (7)

Diagonal channel routing with vias at unit distance ⋮ Hexagonal three-layer channel routing ⋮ Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI ⋮ Optimal multilayer channel routing with overlap ⋮ Maximum \(k\)-covering of weighted transitive graphs with applications ⋮ Some polynomially solvable subcases of the detailed routing problem in VLSI design ⋮ Routing multiterminal nets on a hexagonal grid

This page was built for publication: Channel routing of multiterminal nets