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

DOI10.1016/0020-0190(92)90193-YMaRDI QIDQ1201874zbMATH OpenOpenAlexFDO

Authors Kim-Heng Teo, Tai-Ching Tuan

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

analysis of algorithmsdata structuresdesign of algorithmsdetailed routing around a rectanglegrid-based wiringoptimizationpriority queueVLSI

Mathematics Subject Classification ID

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

Recommendations

• A linear time algorithm for optimal routing around a rectangle
• Algorithms for routing around a rectangle
• River routing in VLSI
• Minimum separation for single-layer channel routing
• A Provably Good Algorithm for the Two Module Routing Problem

Cites work

• 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
• Preserving order in a forest in less than logarithmic time and linear space
• Routing Multiterminal Nets Around a Rectangle

Cited in

(1)

• Algorithms for routing around a rectangle

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

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