Efficient placement and routing techniques for master slice LSI
DAC '80 Proceedings of the 17th Design Automation Conference
A proper model for the partitioning of electrical circuits
DAC '72 Proceedings of the 9th Design Automation Workshop
A class of min-cut placement algorithms
DAC '77 Proceedings of the 14th Design Automation Conference
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
A placement capability based on partitioning
DAC '79 Proceedings of the 16th Design Automation Conference
An Improved Min-Cut Algonthm for Partitioning VLSI Networks
IEEE Transactions on Computers
Graph Bisection Algorithins With Good Average Case Behavior
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Multiple-Way Network Partitioning
IEEE Transactions on Computers
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial
Journal of Heuristics
SHARP-looking geometric partitioning
EURO-DAC '91 Proceedings of the conference on European design automation
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
A tabu search approach for assigning cells to switches in cellular mobile networks
Computer Communications
Assigning cells to switches in cellular mobile networks: a comparative study
Computer Communications
| Hi-index | 14.98 |
In analyzing the effectiveness of min-cut partitioning heuristics, we are faced with the task of constructing ``random'' looking test networks with a prescribed cut-set size in its optimal partition. We present a technique for constructing networks over a given set of components that has been a priori partitioned into two parts. The networks have the property that the optimal partition, i.e., one that minimizes the size of the cut-set, is the predefined partition, and this partition has a cut-set of a given size. Furthermore, these networks can be designed to possess certain statistical properties, such as a desired mean and standard deviation for the number of components per net, so that they truly reflect the input space in the application domain. We also extend these techniques to the generalized partitioning problem.