Faster and simpler traversal of 0/1-polytopes

Jiří Fink, Petr Hladík, Arturo Merino +2

Recently, Merino and Mütze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope $\mathrm{conv}(X)$, where $X\subseteq \{0,1{\}}^n$…