Routing Multiterminal Nets Around a Rectangle

DOI10.1109/TC.1986.5009431zbMATH Open0619.94027MaRDI QIDQ3757840FDOQ3757840

Authors: Sing-Ling Lee, Teofilo F. Gonzalez 

Publication date: 1986

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Recommendations

• A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
• Grid stretching algorithms for routing multiterminal nets through a rectangle
• Routing in polygons without rectilinearly visible corners
• Algorithms for routing around a rectangle
• Routing through a generalized switchbox

zbMATH Keywords

approximation algorithmVLSIgreedy methodslayoutswire routingminimize area

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited In (6)

• Grid stretching algorithms for routing multiterminal nets through a rectangle
• Routing in polygonal domains
• Internet packet filter management and rectangle geometry
• A linear time algorithm for optimal routing around a rectangle
• Algorithms for routing around a rectangle
• An efficient one-side height minimization algorithm for routing around a rectangle

This page was built for publication: Routing Multiterminal Nets Around a Rectangle

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