par Aboulker, Pierre ;Fiorini, Samuel ;Huynh, Tony ;Macchia, Marco ;Seif, Johanna
Référence Operations research letters, 47, 1, page (47-51)
Publication Publié, 2019
Article révisé par les pairs
Résumé : We prove that for every n-vertex graph G, the extension complexity of the correlation polytope of G is 2O(tw(G)+logn), where tw(G) is the treewidth of G. Our main result is that this bound is tight for graphs contained in minor-closed classes.

Documents en relation

DI-fusion