A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem

  title={A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem},
  author={Damir Ferizovi{\'c}},
We examine the application of existing and new kernelization techniques for a well-known NP-hard problem, Max-Cut. Given an undirected graph, the task is to nd a bipartition of the vertex set that maximizes the total weight of edges that have their endpoints in di erent partitions. We primarily focus on the unweighted case, but we also consider the signed and weighted versions to some extent. Reduction rules are e ective for solving many NP-hard problems in practice. They compute a smaller… 

Engineering Kernelization for Maximum Cut

On social and biological networks in particular, kernelization enables us to solve four instances that were previously unsolved in a ten-hour time limit with state-of-the-art solvers, and three of these instances are now solved in less than two seconds.



Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

The Goemans--Williamson randomized algorithm guarantees a high-quality approximation to the MAX-CUT problem, but the cost associated with such an approximation can be excessively high for large-scale

Finding near-optimal independent sets at scale

This paper develops an advanced evolutionary algorithm that uses fast graph partitioning with local search algorithms to implement efficient combine operations that exchange whole blocks of given independent sets and shows how to combine these guesses with kernelization techniques in a branch-and-reduce-like algorithm to compute high-quality independent sets quickly in huge complex networks.

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

This approach uses Lagrangian duality to obtain a “nearly optimal” solution of the basic semidefinite Max-Cut relaxation, strengthened by triangle inequalities, and could prove optimality for several problems of the literature where, to the best of the knowledge, no other method is able to do so.

Scalable Kernelization for Maximum Independent Sets

This work combines an efficient parallel kernelization algorithm based on graph partitioning and parallel bipartite maximum matching with two techniques to accelerate kernelization further, and produces kernels that are orders of magnitude smaller than the fastest kernelization methods while having a similar execution time.

On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles

Several NP-hard problems, like Maximum Independent Set, Coloring, and Max-Cut are polynomial time solvable on bipartite graphs if the length of the longest odd cycle is bounded by k.

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable

It is shown that Max-Cut-AST admits an algorithm that runs in time \(\mathcal {O}(8^kn^{\mathcal{O} (1)})\), and hence it is fixed parameter tractable with respect to k, and has a polynomial kernel of size \(\math CAL {O](k^5)\).

Parameterizing above Guaranteed Values: MaxSat and MaxCut

This paper investigates the parameterized complexity of the problems MaxSat and MaxCut using the framework developed by Downey and Fellows, and shows that these problems remain fixed-parameter tractable even under this parameterization, and gives an algorithm for finding a cut of size at leastk.

The Method of Extremal Structure on the k-Maximum Cut Problem

Using the Method of Extremal Structure, which combines the use of reduction rules as a preprocessing technique and combinatorial extremal arguments, we will prove the fixed-parameter tractability and

Linear-Time Approximation Algorithms for the Max Cut Problem

  • N. NgocZ. Tuza
  • Mathematics
    Combinatorics, Probability and Computing
  • 1993
Infinite families of graphs show that each of those lower bounds on the worst-case performance are best possible (for every algorithm).

Note on maximal bisection above tight lower bound