Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU

09/13/2021
by   René van Bevern, et al.
0

The NP-hard Multiple Hitting Set problem is finding a minimum-cardinality set intersecting each of the sets in a given input collection a given number of times. Generalizing a well-known data reduction algorithm due to Weihe, we show a problem kernel for Multiple Hitting Set parameterized by the Dilworth number, a graph parameter introduced by Foldes and Hammer in 1978 yet seemingly so far unexplored in the context of parameterized complexity theory. Using matrix multiplication, we speed up the algorithm to quadratic sequential time and logarithmic parallel time. We experimentally evaluate our algorithms. By implementing our algorithm on GPUs, we show the feasability of realizing kernelization algorithms on SIMD (Single Instruction, Multiple Date) architectures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2019

Parameterized Complexity of Safe Set

In this paper we study the problem of finding a small safe set S in a gr...
research
09/25/2020

Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability

We study the problem of finding a maximum cardinality minimal separator ...
research
01/11/2021

Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst...
research
11/22/2022

Kernelization of Discrete Optimization Problems on Parallel Architectures

There are existing standard solvers for tackling discrete optimization p...
research
03/10/2022

Parameterized Algorithms for Upward Planarity

We obtain new parameterized algorithms for the classical problem of dete...
research
11/30/2020

Homology Localization Through the Looking-Glass of Parameterized Complexity Theory

Finding a cycle of lowest weight that represents a homology class in a s...
research
04/21/2019

A mechanism for balancing accuracy and scope in cross-machine black-box GPU performance modeling

The ability to model, analyze, and predict execution time of computation...

Please sign up or login with your details

Forgot password? Click here to reset