Minimizing channel density with movable terminals

DOI10.1007/BF02522820MaRDI QIDQ675304zbMATH OpenFDO

Authors Ronald I. Greenberg, Jau-Der Shih

Publication date 30 June 1997

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02522820

zbMATH Keywords

VLSI channel-routing problemsVLSI layout algorithms

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 4118301
• Minimizing the density of terminal assignments in layout design
• Minimizing channel density in standard cell layout
• Routing through a Dense Channel with Minimum Total Wire Length
• Finding all minimal shapes in a routing channel

Cites work

• scientific article; zbMATH DE number 1003242 (Why is no real title available?)
• Finding all minimal shapes in a routing channel
• Optimal Wiring of Movable Terminals

Cited in

(4)

• scientific article; zbMATH DE number 140125 (Why is no real title available?)
• Minimizing the density of terminal assignments in layout design
• scientific article; zbMATH DE number 4118301 (Why is no real title available?)
• Maximum alignment of interchangeable terminals

This page was built for publication: Minimizing channel density with movable terminals

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