Pith. sign in

REVIEW 1 cited by

Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.07250 v1 pith:3MGTDXIN submitted 2022-06-15 cs.DS cs.CG

Yury Makarychev , Naren Sarayu Manoj , Max Ovsiankin This is my paper · ORCID
classification cs.DScs.CG
keywords algorithmsapproximationconvexellipsoidalpolytopestreamingaspectdeterministic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Geometric Approach to Problems in Optimization and Data Science

    math.OC 2025-04 conditional novelty 3.0 of 10

    The thesis provides near-optimal streaming ellipsoidal rounding algorithms, block Lewis weight sparsification, dueling optimization with monotone adversaries, PAC analysis of backdoors, and spectral clustering robustn...

Pith tools