Fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphs

Thang Nguyen Bui, Byung Ro Moon

Research output: Contribution to journalConference articlepeer-review

19 Scopus citations

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 languageEnglish (US)
Pages (from-to)664-669
Number of pages6
JournalProceedings - Design Automation Conference
StatePublished - Dec 1 1994
EventProceedings of the 31st Design Automation Conference - San Diego, CA, USA
Duration: Jun 6 1994Jun 10 1994

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphs'. Together they form a unique fingerprint.

Cite this