Faster Parallel Multiterminal Cuts

04/24/2020
by   Monika Henzinger, et al.
0

We give an improved branch-and-bound solver for the multiterminal cut problem, based on the recent work of Henzinger et al.. We contribute new, highly effective data reduction rules to transform the graph into a smaller equivalent instance. In addition, we present a local search algorithm that can significantly improve a given solution to the multiterminal cut problem. Our exact algorithm is able to give exact solutions to more and harder problems compared to the state-of-the-art algorithm by Henzinger et al.; and give better solutions for more than two third of the problems that are too large to be solved to optimality. Additionally, we give an inexact heuristic algorithm that computes high-quality solutions for very hard instances in reasonable time.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/04/2022

Faster exact solution of sparse MaxCut and QUBO problems

The maximum-cut problem is one of the fundamental problems in combinator...
10/07/2019

Faster Minimum k-cut of a Simple Graph

We consider the (exact, minimum) k-cut problem: given a graph and an int...
08/12/2020

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

Given a vertex-weighted graph, the maximum weight independent set proble...
08/16/2018

Shared-memory Exact Minimum Cuts

The minimum cut problem for an undirected edge-weighted graph asks us to...
05/26/2019

Engineering Kernelization for Maximum Cut

Kernelization is a general theoretical framework for preprocessing insta...
05/09/2020

Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising

Bipartite b-matching is fundamental in algorithm design, and has been wi...
03/04/2022

Improving Ant Colony Optimization Efficiency for Solving Large TSP Instances

Ant Colony Optimization (ACO) is a family of nature-inspired metaheurist...
This week in AI

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