Randomized Rounding for the Largest Simplex Problem

Aleksandar Nikolov

The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in ${\mathbb{Q}}^d$. We give…