Parameterized approximation via fidelity preserving transformations

Abstract

We motivate and describe a new parameterized approximation paradigm which studies the interaction between approximation ratio and running time for any parametrization of a given optimization problem. As a key tool, we introduce the concept of an α-shrinking transformation, for α≥1. Applying such transformation to a parameterized problem instance decreases the parameter value, while preserving the approximation ratio of α (or α-fidelity). Moving even beyond the approximation ratio, we call for a new type of approximative kernelization race. Our α-shrinking transformations can be used to obtain approximative kernels which are smaller than the best known for a given problem. The smaller “α-fidelity” kernels allow us to obtain an exact solution for the reduced instance more efficiently, while obtaining an approximate solution for the original instance. We show that such fidelity preserving transformations exist for several fundamental problems, including Vertex Cover, d-Hitting Set, Connected Vertex Cover and Steiner Tree.