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

DOI10.1007/BF02523682zbMath1067.68788OpenAlexW2809748795MaRDI QIDQ676272

Hung-Yi Tu, Susanne E. Hambrusch

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

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

Cites Work

• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Minimizing total wire length during 1-dimensional compaction
• Unnamed Item
• Unnamed Item

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