Issue No. 04 - April (1999 vol. 48)

ISSN: 0018-9340

pp: 361-385

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.762522

ABSTRACT

<p><b>Abstract</b>—New heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction scheme with an appropriate <it>tie-breaking</it> rule (M<scp>in</scp>-M<scp>ax</scp>-G<scp>reedy</scp>) produces initial assignments in a very fast time. For some classes of graphs, independent repetitions of M<scp>in</scp>-M<scp>ax</scp>-G<scp>reedy</scp> are sufficient to reproduce solutions found by more complex techniques. When the method is not competitive, the initial assignments are used as starting points for a prohibition-based scheme, where the prohibition is chosen in a randomized and <it>reactive</it> way, with a bias towards more successful choices in the previous part of the run. The relationship between prohibition-based diversification (Tabu Search) and the variable-depth Kernighan-Lin algorithm is discussed. Detailed experimental results are presented on benchmark suites used in the previous literature, consisting of graphs derived from parametric models (random graphs, geometric graphs, etc.) and of “real-world” graphs of large size. On the first series of graphs, a better performance for equivalent or smaller computing times is obtained, while, on the large “real-world” instances, significantly better results than those of multilevel algorithms are obtained, but for a much larger computational effort.</p>

INDEX TERMS

Graph bisection, graph partitioning, heuristic algorithms, iterative improvement, local search, reactive search.

CITATION

Alan Albert Bertossi, Roberto Battiti, "Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning",

*IEEE Transactions on Computers*, vol. 48, no. , pp. 361-385, April 1999, doi:10.1109/12.762522