34 citations · 60 across the 20 of their papers we have counts for
5 papers · 1 filter
Nearly-Tight Bounds for Zonotope Containment and Beyond
Friedrich Eisenbrand, Thomas Rothvoss, Matteo Russo +1
We investigate the convex-body containment problem , where the outer body is described by a membership oracle and the inne…
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity
Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk +2
We consider the problem of solving integer programs of the form , where is a multistage stochastic matrix in the following sens…
Local Search for Max-Sum Diversification
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
We provide simple and fast polynomial time approximation schemes (PTASs) for several variants of the max-sum diversification problem which, in its most basic form, is as follows: G…
Max-sum diversity via convex programming
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Diversity maximization is an important concept in information retrieval, computational geometry and operations research. Usually, it is a variant of the following problem: Given a…
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…