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

DOI10.1137/S0895480188161586MaRDI QIDQ4296517zbMATH OpenOpenAlexFDO

Authors Tom Leighton

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) Discrete mathematics in relation to computer science (68R99) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296517)