Differential greedy for the 0-1 equicut problem

Given the success of recent greedy schemes with tie-breaking rules proposed by the authors, this paper extends the investigation by considering diierent greedy approaches for the graph bi-partitioning problem. In particular , a new method is proposed (Diff-Greedy) that ameliorates in a signiicant way the performance of the previously proposed Min-Max-Greedy, while requiring less computation. The computational complexity is demonstrated to be O(jEj), E being the edge set of the graph. Experimental results are presented for a large sample of two classes of randomly generated graphs, one with a connection probability independent of the vertices, the second one with a two-dimensional geometric structure. Remarkably enough, the cut sizes obtained through independent repetitions are close to, and in some cases better than the cut sizes obtainedby more sophisticatedtechniquesbased on standard greedy construction followed by local search with prohibition-based diversii-cation (Tabu Search), for comparable running times.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Fred W. Glover,et al.  Tabu search for graph partitioning , 1996, Ann. Oper. Res..

[3]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[4]  Frank Thomson Leighton,et al.  Graph bisection algorithms with good average case behavior , 1984, Comb..

[5]  I ScottKirkpatrick Optimization by Simulated Annealing: Quantitative Studies , 1984 .

[6]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7]  Andrew M. Peck,et al.  Partitioning Planar Graphs , 1992, SIAM J. Comput..

[8]  Erik Rolland,et al.  Heuristic solution Procedures for the Graph Partitioning Problem , 1992, Computer Science and Operations Research.

[9]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[10]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.

[11]  Manuel Laguna,et al.  A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem , 1994, Oper. Res..

[12]  Mauro Dell'Amico,et al.  A New Tabu Search Approach to the 0–1 Equicut Problem , 1996 .

[13]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[14]  Erik Rolland,et al.  New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation , 1994, Comput. Oper. Res..

[15]  Brian Kernighan,et al.  An efficient heuristic for partitioning graphs , 1970 .