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

01/11/2021
by   Petr A. Golovach, et al.
0

An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst. 2017] for a parameterized enumeration problem consists of an algorithm that transforms each instance into one whose size is bounded by the parameter plus a solution-lifting algorithm that efficiently enumerates all solutions from the set of the solutions of the kernel. We propose to consider two new versions of enumeration kernels by asking that the solutions of the original instance can be enumerated in polynomial time or with polynomial delay from the kernel solutions. Using the NP-hard Matching Cut problem parameterized by structural parameters such as the vertex cover number or the cyclomatic number of the input graph, we show that the new enumeration kernels present a useful notion of data reduction for enumeration problems which allows to compactly represent the set of feasible solutions.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/25/2018

Parameterized algorithms and data reduction for the short secluded s-t-path problem

Given a graph G=(V,E), two vertices s,t∈ V, and two integers k,ℓ, we sea...
09/27/2018

Reoptimization of Parameterized Problems

Parameterized complexity allows us to analyze the time complexity of pro...
04/24/2020

Using monodromy to statistically estimate the number of solutions

Synthesis problems for linkages in kinematics often yield large structur...
09/13/2021

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

The NP-hard Multiple Hitting Set problem is finding a minimum-cardinalit...
07/10/2018

Computing Kernels in Parallel: Lower and Upper Bounds

Parallel fixed-parameter tractability studies how parameterized problems...
03/04/2020

Scheduling Kernels via Configuration LP

Makespan minimization (on parallel identical or unrelated machines) is a...
02/28/2019

A Hierarchy of Polynomial Kernels

In parameterized algorithmics, the process of kernelization is defined a...
This week in AI

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