Nearly optimal algorithms and bounds for multilayer channel routing

DOI10.1145/201019.201037zbMath0886.68021OpenAlexW2059322084MaRDI QIDQ4369873

Donna J. Brown, Bonnie Berger, Martin L. Brady, Leighton, Tom

Publication date: 2 February 1998

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

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

zbMATH Keywords

routing channels

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (4)

Optimal multilayer channel routing with overlap ⋮ Some polynomially solvable subcases of the detailed routing problem in VLSI design ⋮ Routing multiterminal nets on a hexagonal grid ⋮ A near-optimal Manhattan channel router for a class of nets with the shift-right-one pattern

This page was built for publication: Nearly optimal algorithms and bounds for multilayer channel routing