44 citations · 213 across the 38 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017★ 1 cited
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
Kaveh Khoshkhah, Dirk Oliver Theis
In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum S…
cs.DM2017★ 2 cited
Fooling Sets and the Spanning Tree Polytope
Kaveh Khoshkhah, Dirk Oliver Theis
In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum S…