Min-cost partitioning on a tree structure and applications
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
The Min-cut shuffle: toward a solution for the global effect problem of Min-cut placement
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
A min-cut placement algorithm for general cell assemblies based on a graph representation
DAC '79 Proceedings of the 16th Design Automation Conference
| Hi-index | 0.00 |
MinCut algorithms have received much attention in the past for treating the placement problem in layout synthesis. The paper introduces a new class of Min-Cut partitioning algorithms (SQP) meeting global minimization requirements. The new class of algorithms in its different variations is empirically compared with the classical MinCut procedures as well as with recent extensions. The new algorithms have shown a significant (10 to 40%) improvement in the overall netlength compared with known algorithms. Moreover, the new class of algorithms is proved to have a linear time complexity.