Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

by   Alexander Gellner, et al.

Given a vertex-weighted graph, the maximum weight independent set problem asks for a pair-wise non-adjacent set of vertices such that the sum of their weights is maximum. The branch-and-reduce paradigm is the de facto standard approach to solve the problem to optimality in practice. In this paradigm, data reduction rules are applied to decrease the problem size. These data reduction rules ensure that given an optimum solution on the new (smaller) input, one can quickly construct an optimum solution on the original input. We introduce new generalized data reduction and transformation rules for the problem. A key feature of our work is that some transformation rules can increase the size of the input. Surprisingly, these so-called increasing transformations can simplify the problem and also open up the reduction space to yield even smaller irreducible graphs later throughout the algorithm. In experiments, our algorithm computes significantly smaller irreducible graphs on all except one instance, solves more instances to optimality than previously possible, is up to two orders of magnitude faster than the best state-of-the-art solver, and finds higher-quality solutions than heuristic solvers DynWVC and HILS on many instances. While the increasing transformations are only efficient enough for preprocessing at this time, we see this as a critical initial step towards a new branch-and-transform paradigm.



page 10

page 16

page 17

page 18

page 19


Engineering Kernelization for Maximum Cut

Kernelization is a general theoretical framework for preprocessing insta...

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs

One powerful technique to solve NP-hard optimization problems in practic...

Shared-Memory Branch-and-Reduce for Multiterminal Cuts

We introduce the fastest known exact algorithm for the multiterminal cut...

Faster Parallel Multiterminal Cuts

We give an improved branch-and-bound solver for the multiterminal cut pr...

Pre-processing for Triangulation of Probabilistic Networks

The currently most efficient algorithm for inference with a probabilisti...

Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality

Mining groups of genes that consistently co-express is an important prob...

Targeted Branching for the Maximum Independent Set Problem

Finding a maximum independent set is a fundamental NP-hard problem that ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.