Grid stretching algorithms for routing multiterminal nets through a rectangle

DOI10.1016/0167-9260(92)90003-HMaRDI QIDQ4015538zbMATH OpenOpenAlexFDO

Authors Teofilo F. Gonzalez, S. Q. Zheng

Publication date 12 January 1993

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-9260(92)90003-h

zbMATH Keywords

approximation algorithmslayoutminimizing areaswitch-box routingVLSI design automation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Circuits, networks (94C99)

Recommendations

• Routing Multiterminal Nets Around a Rectangle
• A 1.6 Approximation Algorithm for Routing Multiterminal Nets
• Algorithms for routing around a rectangle
• scientific article; zbMATH DE number 3932954
• Routing in polygons without rectilinearly visible corners

Cited in

(2)

• Routing Multiterminal Nets Around a Rectangle
• On the routability of a convex grid

This page was built for publication: Grid stretching algorithms for routing multiterminal nets through a rectangle

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