2000 character limit reached
Integrality Gap of the Vertex Cover Linear Programming Relaxation
Published 25 Jul 2019 in cs.DS and cs.DM | (1907.11209v1)
Abstract: 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 $\left(2-\frac{2}{\chif(G)}\right)$ where $\chif(G)$ denotes the fractional chromatic number of G.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.