π
π
The Cartographer
Integrality Gap of the Vertex Cover Linear Programming Relaxation
July 25, 2019 Β· Declared Dead Β· π Operations Research Letters
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Mohit Singh
arXiv ID
1907.11209
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM
Citations
6
Venue
Operations Research Letters
Last Checked
4 months ago
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}{Ο^f(G)}\right)$ where $Ο^f(G)$ denotes the fractional chromatic number of G.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted