AI Chat AI Image Generator AI Video Text to Speech

Integrality Gap of the Vertex Cover Linear Programming Relaxation

07/25/2019

∙

by Mohit Singh, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 03/13/2019

Refuting conjectures in extremal combinatorics via linear programming

We apply simple linear programming methods and an LP solver to refute a ...

0 Adam Zsolt Wagner, et al. ∙

research

∙ 04/24/2023

Fractional eternal domination: securely distributing resources across a network

This paper initiates the study of fractional eternal domination in graph...

0 Fnu Devvrit, et al. ∙

research

∙ 07/12/2019

Linear programming bounds for cliques in Paley graphs

The Lovász theta number is a semidefinite programming bound on the cliqu...

0 Mark Magsino, et al. ∙

research

∙ 02/07/2018

Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem

The distribution of the computational cost of linear-programming (LP) re...

0 Satoshi Takabe, et al. ∙

research

∙ 04/23/2021

The Metric Relaxation for 0-Extension Admits an Ω(log^2/3k) Gap

We consider the 0-Extension problem, where we are given an undirected gr...

0 Roy Schwartz, et al. ∙

research

∙ 06/12/2020

Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs

We present a new algorithm, Fractional Decomposition Tree (FDT) for find...

0 Robert D. Carr, et al. ∙

research

∙ 07/03/2019

Towards improving Christofides algorithm for half-integer TSP

We study the traveling salesman problem (TSP) in the case when the objec...

0 Arash Haddadan, et al. ∙