33 citations · 53 across the 12 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 1 cited
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm
Tobias Brunsch, Anna Großwendt, Heiko Röglin
We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number of variables, the number of con…
cs.LG2014★ 2 cited
Efficient Clustering with Limited Distance Information
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model w…