Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes
Data Structures and Algorithms
2022-06-16 v1 Computational Geometry
Abstract
We give efficient deterministic one-pass streaming algorithms for finding an ellipsoidal approximation of a symmetric convex polytope. The algorithms are near-optimal in that their approximation factors differ from that of the optimal offline solution only by a factor sub-logarithmic in the aspect ratio of the polytope.
Cite
@article{arxiv.2206.07250,
title = {Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes},
author = {Yury Makarychev and Naren Sarayu Manoj and Max Ovsiankin},
journal= {arXiv preprint arXiv:2206.07250},
year = {2022}
}
Comments
Accepted to COLT 2022