On the difficulty of Manhattan channel routing

DOI10.1016/0020-0190(92)90214-GzbMath0764.94023OpenAlexW2002801458MaRDI QIDQ1209358

Ronald I. Greenberg, Sridhar Krishnamurthy, Joseph F. Ja'Ja'

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90214-g

zbMATH Keywords

NP-completechannel routingManhattan model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

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

This page was built for publication: On the difficulty of Manhattan channel routing