An efficient lower bound algorithm for channel routing

DOI10.1016/0167-9260(95)00024-0MaRDI QIDQ3122485zbMATH OpenOpenAlexFDO

Authors Heng-Yi Chao, Mary P. Harper

Publication date 27 February 1997

Published in Integration (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/ecetr/110

zbMATH Keywords

CAD on VLSIChannel routingDAGLower boundPhysical designTransitive closure

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An algorithm for finding a non-trivial lower bound for channel routing
• Nearly optimal algorithms and bounds for multilayer channel routing
• scientific article; zbMATH DE number 6538149
• scientific article; zbMATH DE number 4077133
• scientific article; zbMATH DE number 3907789

Cited in

(5)

• A minimum interference routing algorithm with reduced computational complexity
• scientific article; zbMATH DE number 6538149 (Why is no real title available?)
• scientific article; zbMATH DE number 3907789 (Why is no real title available?)
• An algorithm for finding a non-trivial lower bound for channel routing
• scientific article; zbMATH DE number 3893100 (Why is no real title available?)

This page was built for publication: An efficient lower bound algorithm for channel routing

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