On Approximating Graph Bipartization via Node Deletion

TL;DR

This paper discusses methods for approximating graph bipartization through node deletion, but the authors withdrew it due to reliance on previously known results.

Contribution

The paper's main contribution was to propose an approximation approach for graph bipartization via node deletion.

Findings

Results follow from known theorems

Authors withdrew the paper

No new empirical or theoretical findings

Abstract

Although the results are correct, it was pointed out that the results follow from some previously known results. Accordingly, this version of the paper is withdrawn by the authors.