Back to Search
Start Over
Integrality Gap of the Vertex Cover Linear Programming Relaxation
- Source :
- Operations Research Letters 47 (4), 288-290, 2019
- Publication Year :
- 2019
-
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}{\chi^f(G)}\right)$ where $\chi^f(G)$ denotes the fractional chromatic number of G.<br />Comment: 6 pages
Details
- Database :
- arXiv
- Journal :
- Operations Research Letters 47 (4), 288-290, 2019
- Publication Type :
- Report
- Accession number :
- edsarx.1907.11209
- Document Type :
- Working Paper