A faster algorithm for Vertex Cover parameterized by solution size

05/16/2022
by   David G. Harris, et al.
0

We describe a new algorithm for vertex cover with runtime O^*(1.25400^k), where k is the size of the desired solution and O^* hides polynomial factors in the input size. This improves over previous runtime of O^*(1.2738^k) due to Chen, Kanj, Xia (2010) standing for more than a decade. The key to our algorithm is to use a potential function which simultaneously tracks k as well as the optimal value λ of the vertex cover LP relaxation. This approach also allows us to make use of prior algorithms for Maximum Independent Set in bounded-degree graphs and Above-Guarantee Vertex Cover. The main step in the algorithm is to branch on high-degree vertices, while ensuring that both k and μ = k - λ are decreased at each step. There can be local obstructions in the graph that prevent μ from decreasing in this process; we develop a number of novel branching steps to handle these situations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/30/2018

Weighted vertex cover on graphs with maximum degree 3

We give a parameterized algorithm for weighted vertex cover on graphs wi...
research
06/22/2019

l-path vertex cover is easier than l-hitting set for small l

In the l-path vertex cover problem the input is an undirected graph G an...
research
05/08/2019

On the Approximate Compressibility of Connected Vertex Cover

The Connected Vertex Cover problem, where the goal is to compute a minim...
research
09/14/2021

Distributed Vertex Cover Reconfiguration

Reconfiguration schedules, i.e., sequences that gradually transform one ...
research
06/14/2019

Exact Crossing Number Parameterized by Vertex Cover

We prove that the exact crossing number of a graph can be efficiently co...
research
12/21/2016

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

This article analyzes the stochastic runtime of a Cross-Entropy Algorith...
research
05/05/2021

Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs

In graph sparsification, the goal has almost always been of global natur...

Please sign up or login with your details

Forgot password? Click here to reset