Weighted vertex cover on graphs with maximum degree 3

TL;DR

This paper presents a parameterized algorithm for the weighted vertex cover problem on graphs with maximum degree 3, achieving a time complexity of O*(1.402^t), where t is the size of the minimum vertex cover.

Contribution

The paper introduces a new parameterized algorithm with improved exponential time complexity for weighted vertex cover on degree-3 graphs.

Findings

Algorithm runs in O*(1.402^t) time

Effective for graphs with maximum degree 3

Advances parameterized complexity for vertex cover

Abstract

We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is $O^*(1.402^t)$, where $t$ is the minimum size of a vertex cover of the input graph.