Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions

by   Matthias Bentert, et al.

Kernelization is the fundamental notion for polynomial-time prepocessing with performance guarantees in parameterized algorithmics. When preprocessing weighted problems, the need of shrinking weights might arise. Marx and Végh [ACM Trans. Algorithms 2015] and Etscheid et al. [J. Comput. Syst. Sci. 2017] used a technique due to Frank and Tardos [Combinatorica 1987] that we refer to as losing-weight technique to obtain kernels of polynomial size for weighted problems. While the mentioned earlier works focus on problems with additive goal functions, we focus on a broader class of goal functions. We lift the losing-weight technique to what we call linearizable goal functions, which also contain non-additive functions. We apply the lifted technique to five exemplary problems, thereby improving two results from the literature by proving polynomial kernels.


page 1

page 2

page 3

page 4


On additive spanners in weighted graphs with local error

An additive +β spanner of a graph G is a subgraph which preserves distan...

Limits of Preprocessing

We present a first theoretical analysis of the power of polynomial-time ...

Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations

We investigate polynomial-time preprocessing for the problem of hitting ...

On the Approximate Compressibility of Connected Vertex Cover

The Connected Vertex Cover problem, where the goal is to compute a minim...

A Class of Weighted TSPs with Applications

Motivated by applications to poaching and burglary prevention, we define...

On the Hardness of Compressing Weights

We investigate computational problems involving large weights through th...

Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning

We present a first theoretical analysis of the power of polynomial-time ...