
Explore streaming algorithms for k-median and k-means clustering, achieving constant space complexity independent of data size and aspect ratio. Improve space and update time for approximate subspace embeddings.

Explore a 1.55-approximation algorithm for Euclidean capacitated vehicle routing in random settings, presented by Zipei Nie.

Explore advanced mathematical concepts in measure concentration, isoperimetry, and Poincaré-type inequalities through Pisier's approach and its extensions to rotationally invariant distributions.

Delve into advanced mathematical concepts exploring the quadratic stability of Brunn-Minkowski inequality, its geometric implications, and connections to related inequalities in convex geometry.