44 citations · 80 across the 32 of their papers we have counts for
Showing 2016 · math.OCShow all
2 papers · 2 filters
math.OC2016
Every rational polyhedron has finite split rank: new proof
Kanstantsin Pashkovich
Split rank of a rational polyhedron is finite. The well known proof of this is based on the fact that split closure is stronger than the Chvátal closure, and the Chvátal rank of a…
math.OC2016
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich +1
In a standard -connectivity network design problem, we are given an undirected graph , a cut-requirement function , and non-negative cos…