Integrality Gap of the Vertex Cover Linear Programming Relaxation

07/25/2019
by   Mohit Singh, et al.
0

We give a characterization result for the integrality gap of the natural linear programming relaxation for the vertex cover problem. We show that integrality gap of the standard linear programming relaxation for any graph G equals (2-2/χ^f(G)) where χ^f(G) denotes the fractional chromatic number of G.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro