5 citations · 6 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
On the Shadow Simplex Method for Curved Polyhedra
Daniel Dadush, Nicolai Hähnle
We study the simplex method over polyhedra satisfying certain "discrete curvature" lower bounds, which enforce that the boundary always meets vertices at sharp angles. Motivated by…
cs.DS2010★ 1 cited
Covering Cubes and the Closest Vector Problem
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the d…