3 citations · 3 across the 1 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2019★ 3 cited
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan +1
``Composable core-sets'' are an efficient framework for solving optimization problems in massive data models. In this work, we consider efficient construction of composable core-se…
cs.DS2018
A Tight Analysis of Bethe Approximation for Permanent
Nima Anari, Alireza Rezaei
We prove that the permanent of nonnegative matrices can be deterministically approximated within a factor of in polynomial time, improving upon the previous determinis…
cs.DS2018
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan +1
We study a spectral generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors , we say a set is an $…