Abstract
A genetic algorithm (GA) for partitioning a hypergraph into two disjoint graphs of least ratio-cut is presented. Two notable features of this algorithm are: (i) a fast local optimizer, and (ii) a preprocessing step. Some supporting combinatorial arguments for the preprocessing heuristic are also provided. Experimental results on industrial benchmarks circuits are favorable when compared with recently published algorithms [25], [26], [19].
| Original language | English (US) |
|---|---|
| Pages (from-to) | 664-669 |
| Number of pages | 6 |
| Journal | Proceedings - Design Automation Conference |
| State | Published - 1994 |
| Event | Proceedings of the 31st Design Automation Conference - San Diego, CA, USA Duration: Jun 6 1994 → Jun 10 1994 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Control and Systems Engineering