A Semidefinite Approach to the $K_i$ Cover Problem
Optimization and Control
2014-02-04 v3 Combinatorics
Abstract
We apply theta body relaxations to the -cover problem and show polynomial time solvability for certain classes of graphs. In particular, we give an effective relaxation where all --hole facets are valid, and study its relation to an open question of Conforti et al. For the triangle free problem, we show for that the theta body relaxations do not converge by steps; we also prove for all an integrality gap of 2 for the second theta body.
Cite
@article{arxiv.1211.0039,
title = {A Semidefinite Approach to the $K_i$ Cover Problem},
author = {João Gouveia and James Pfeiffer},
journal= {arXiv preprint arXiv:1211.0039},
year = {2014}
}