A Round and Bipartize Approximation Algorithm for Vertex Cover

by   Danish Kashaev, et al.

The vertex cover problem is a fundamental and widely studied combinatorial optimization problem. It is known that its standard linear programming relaxation is integral for bipartite graphs and half-integral for general graphs. As a consequence, the natural rounding algorithm based on this relaxation computes an optimal solution for bipartite graphs and a 2-approximation for general graphs. This raises the question of whether one can obtain improved bounds on the approximation ratio, depending on how close the graph is to being bipartite. In this paper, we consider a round-and-bipartize algorithm that exploits the knowledge of an induced bipartite subgraph to attain improved approximation ratios. Equivalently, we suppose that we have access to a subset of vertices S whose removal bipartizes the graph. If S is an independent set, we prove an approximation ratio of 1 + 1/ρ, where 2ρ -1 denotes the odd girth of the contracted graph 𝒢̃ := 𝒢 /S and thus satisfies ρ≥ 2. We show that this is tight for any graph and independent set by providing a family of weight functions for which this bound is attained. In addition, we give tight upper bounds for the fractional chromatic number and the integrality gap of such graphs, both of which also depend on the odd girth. If S is an arbitrary set, we prove a tight approximation ratio of (1+1/ρ) (1 - α) + 2 α, where α∈ [0,1] denotes the total normalized dual sum of the edges lying inside of the set S. As an algorithmic application, we show that for any efficiently k-colorable graph with k ≥ 4 we can find a bipartizing set satisfying α≤ 1 - 4/k. This provides an approximation algorithm recovering the bound of 2 - 2/k in the worst case (i.e., when ρ = 2), which is best possible for this setting when using the standard relaxation.


page 1

page 2

page 3

page 4


An Improved Approximation for Maximum k-Dependent Set on Bipartite Graphs

We present a (1+k/k+2)-approximation algorithm for the Maximum k-depende...

Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs

We consider the classic budgeted maximum weight independent set (BMWIS) ...

Vertex removal in biclique graphs

A biclique is a maximal bipartite complete induced subgraph. The bicliqu...

Improved approximation algorithms for path vertex covers in regular graphs

Given a simple graph G = (V, E) and a constant integer k > 2, the k-path...

Stochastic Vertex Cover with Few Queries

We study the minimum vertex cover problem in the following stochastic se...

Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities

Prophet inequalities consist of many beautiful statements that establish...

The generalized vertex cover problem and some variations

In this paper we study the generalized vertex cover problem (GVC), which...

Please sign up or login with your details

Forgot password? Click here to reset