DocumentCode
452091
Title
A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs
Author
Bui, Thang Nguyen ; Moon, Byung Ro
Author_Institution
Dept. of Computer Science, Pennsylvania State University, Middletown, PA
fYear
1994
fDate
6-10 June 1994
Firstpage
664
Lastpage
669
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].
Keywords
Design automation; Distributed computing; Genetic algorithms; Machinery; Permission;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1994. 31st Conference on
ISSN
0738-100X
Print_ISBN
0-89791-653-0
Type
conf
DOI
10.1109/DAC.1994.204185
Filename
1600458
Link To Document