no code implementations • 3 Sep 2020 • Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande
We formulate network design as the problem of constructing a network that efficiently supports a multi-commodity flow problem.
no code implementations • 16 Jul 2018 • Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff
On the algorithmic side, for $p \in (0, 2)$, we give the first $(1+\epsilon)$-approximation algorithm running in time $n^{\text{poly}(k/\epsilon)}$.
no code implementations • NeurIPS 2017 • Karl Bringmann, Pavel Kolev, David Woodruff
For small $\psi$, our approximation factor is $1+o(1)$.
no code implementations • 30 Oct 2017 • Karl Bringmann, Pavel Kolev, David P. Woodruff
For small $\psi$, our approximation factor is $1+o(1)$.