3 papers
cs.DM2023
Integer points in the degree-sequence polytope
Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi
An integer vector is a degree sequence if there exists a hypergraph with vertices such that each is the number of hyperedges containing $…
cs.DS2016
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…
cs.CG2014
On largest volume simplices and sub-determinants
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza +1
We show that the problem of finding the simplex of largest volume in the convex hull of points in can be approximated with a factor of in polyn…