论文信息 - Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem

Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem

Abstract The Max-Cut problem is a classical NP-hard problem where the objective is to partition the nodes of an edge-weighted graph in a way that maximizes the sum of edges between the parts. We present a greedy heuristic for solving Max-Cut that combines an Edge-Contraction heuristic with the Differencing Method. We compare the heuristic’s performance to other greedy heuristics using a large and diverse set of problem instances.

Refael Hassin | Nikita Leshenko

[1] Franz Rendl,et al. Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations , 2009, Math. Program..

[2] Yll Haxhimusa,et al. Estimation of Distribution Algorithm for the Max-Cut Problem , 2013, GbRPR.

[3] Martin Grötschel,et al. An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[4] Joachim M. Buhmann,et al. Greedy MaxCut algorithms and their information content , 2015, ITW 2015.

[5] Sergiy Butenko,et al. On greedy construction heuristics for the MAX-CUT problem , 2007, Int. J. Comput. Sci. Eng..

[6] Francisco Barahona,et al. Network Design Using Cut Inequalities , 1996, SIAM J. Optim..

[7] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[8] Iain Dunning,et al. What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO , 2018, INFORMS J. Comput..

[9] Joachim M. Buhmann,et al. Greedy MaxCut algorithms and their information content , 2015, 2015 IEEE Information Theory Workshop (ITW).

[10] Joseph Naor,et al. A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2015, SIAM J. Comput..