Another Disjoint Compression Algorithm for OCT

TL;DR

This paper introduces an efficient O*(2^k) algorithm for the disjoint compression problem in Odd Cycle Transversal, utilizing a reduction to Above Guarantee Vertex Cover, enhancing the understanding of existing algorithms.

Contribution

It presents a novel algorithm that refines the complexity and approach for solving the disjoint compression problem in Odd Cycle Transversal.

Findings

Algorithm operates in O*(2^k) time

Reduces problem to Above Guarantee Vertex Cover

Improves understanding of Odd Cycle Transversal algorithms

Abstract

We describe an elegant O*(2^k) algorithm for the disjoint compression problem for Odd Cycle Transversal based on a reduction to Above Guarantee Vertex Cover. We believe that this algorithm refines the understanding of the Odd Cycle Transversal algorithm by Reed, Smith and Vetta.