A $2d - 1$ Lower Bound for Two-Layer Knock-Knee Channel Routing

DOI10.1137/S0895480188161586zbMath0938.68677OpenAlexW2166357529MaRDI QIDQ4296517

Leighton, Tom

Publication date: 21 June 2000

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480188161586

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Some polynomially solvable subcases of the detailed routing problem in VLSI design

This page was built for publication: A $2d - 1$ Lower Bound for Two-Layer Knock-Knee Channel Routing