Finding all minimal shapes in a routing channel

DOI10.1007/PL00009213zbMath0897.68057OpenAlexW2079600607MaRDI QIDQ1387837

L.-F. Chao, Andrea S. LaPaugh

Publication date: 3 August 1998

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

VLSI layoutchannel routingchannel densitychannel placement problemcomponent placement

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computer system organization (68M99)

Related Items (1)

Minimizing channel density with movable terminals

This page was built for publication: Finding all minimal shapes in a routing channel