An efficient one-side height minimization algorithm for routing around a rectangle

DOI10.1016/0020-0190(92)90193-YzbMath0786.68046OpenAlexW2035385212MaRDI QIDQ1201874

Tai-Ching Tuan, Kim-Heng Teo

Publication date: 17 January 1993

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

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

zbMATH Keywords

optimizationanalysis of algorithmsdata structuresdesign of algorithmspriority queueVLSIdetailed routing around a rectanglegrid-based wiring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Preserving order in a forest in less than logarithmic time and linear space
• Routing Multiterminal Nets Around a Rectangle
• A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
• A linear time algorithm for optimal routing around a rectangle
• Design and implementation of an efficient priority queue

This page was built for publication: An efficient one-side height minimization algorithm for routing around a rectangle