Search-Space Reduction via Essential Vertices

by   Benjamin Merlin Bumpus, et al.

We investigate preprocessing for vertex-subset problems on graphs. While the notion of kernelization, originating in parameterized complexity theory, is a formalization of provably effective preprocessing aimed at reducing the total instance size, our focus is on finding a non-empty vertex set that belongs to an optimal solution. This decreases the size of the remaining part of the solution which still has to be found, and therefore shrinks the search space of fixed-parameter tractable algorithms for parameterizations based on the solution size. We introduce the notion of a c-essential vertex as one that is contained in all c-approximate solutions. For several classic combinatorial problems such as Odd Cycle Transversal and Directed Feedback Vertex Set, we show that under mild conditions a polynomial-time preprocessing algorithm can find a subset of an optimal solution that contains all 2-essential vertices, by exploiting packing/covering duality. This leads to FPT algorithms to solve these problems where the exponential term in the running time depends only on the number of non-essential vertices in the solution.


page 1

page 5

page 7

page 9

page 11

page 19

page 21


Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set

The goal of this paper is to open up a new research direction aimed at u...

Subset Feedback Vertex Set in Chordal and Split Graphs

In the Subset Feedback Vertex Set (Subset-FVS) problem the input is a gr...

Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems

This article analyzes the stochastic runtime of a Cross-Entropy Algorith...

Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size

The (Weighted) Subset Feedback Vertex Set problem is a generalization of...

Expansion Lemma – Variations and Applications to Polynomial-Time Preprocessing

In parameterized complexity, it is well-known that a parameterized probl...

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs

Subexponential parameterized algorithms are known for a wide range of na...

Diversity in Kemeny Rank Aggregation: A Parameterized Approach

In its most traditional setting, the main concern of optimization theory...

Please sign up or login with your details

Forgot password? Click here to reset