New algorithms for mimizing the longest wire length during circuit compaction.

DOI10.1007/BF02523682MaRDI QIDQ676272zbMATH OpenOpenAlexFDO

Authors Susanne E. Hambrusch, Hung-Yi Tu

Publication date 7 August 1997

Published in Algorithmica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Minimizing total wire length during 1-dimensional compaction

This page was built for publication: New algorithms for mimizing the longest wire length during circuit compaction.

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