44 citations · 80 across the 32 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.OC2017
On the Circuit Diameter of some Combinatorial Polytopes
Sean Kafer, Kanstantsin Pashkovich, Laura Sanità
The combinatorial diameter of a polytope is the maximum value of a shortest path between two vertices of , where the path uses the edges of only. In contrast to the comb…
cs.DM2017
On the Integrality Gap of the Prize-Collecting Steiner Forest LP
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich +3
In the prize-collecting Steiner forest (PCSF) problem, we are given an undirected graph , edge costs , terminal pairs , and…
math.CO2017
Enumeration of -level polytopes
Adam Bohn, Yuri Faenza, Samuel Fiorini +3
A (convex) polytope is said to be -level if for every direction of hyperplanes which is facet-defining for , the vertices of can be covered with two hyperplanes of th…