Minimizing channel density with movable terminals

DOI10.1007/BF02522820zbMATH Open0865.68063MaRDI QIDQ675304FDOQ675304

Jau-Der Shih, Ronald I. Greenberg

Publication date: 30 June 1997

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

VLSI channel-routing problemsVLSI layout algorithms

Mathematics Subject Classification ID

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

Cites Work

• Finding all minimal shapes in a routing channel
• Optimal Wiring of Movable Terminals
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Minimizing the density of terminal assignments in layout design
• Title not available (Why is that?)
• 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)