Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Discrete Mathematics
2021-03-30 v2 Combinatorics
Optimization and Control
Abstract
Let be an -node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC'17) for bimodular integer programs can be used to find a maximum weight stable set in in strongly polynomial time. Building on structural results characterizing sufficiently connected graphs without two disjoint odd cycles, we construct a size- extended formulation for the stable set polytope of .
Keywords
Cite
@article{arxiv.1911.12179,
title = {Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles},
author = {Michele Conforti and Samuel Fiorini and Tony Huynh and Stefan Weltge},
journal= {arXiv preprint arXiv:1911.12179},
year = {2021}
}
Comments
19 pages, 3 figures