Composable Core-sets for Determinant Maximization Problems via Spectral Spanners

DOI10.1137/1.9781611975994.103MaRDI QIDQ5146881zbMATH OpenOpenAlexFDO

Authors Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei, Piotr Indyk

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.11648

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Deterministic coresets for stochastic matrices with applications to scalable sparse PageRank
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• scientific article; zbMATH DE number 7758358 (Why is no real title available?)
• An empirical evaluation of k-means coresets

This page was built for publication: Composable Core-sets for Determinant Maximization Problems via Spectral Spanners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146881)