Integrality Gap of the Vertex Cover Linear Programming Relaxation
Data Structures and Algorithms
2019-07-26 v1 Discrete Mathematics
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 where denotes the fractional chromatic number of G.
Cite
@article{arxiv.1907.11209,
title = {Integrality Gap of the Vertex Cover Linear Programming Relaxation},
author = {Mohit Singh},
journal= {arXiv preprint arXiv:1907.11209},
year = {2019}
}
Comments
6 pages