Review for NeurIPS paper: Fast and Accurate k -means++ via Rejection Sampling

Additional Feedback: Overall: Why only 3 trees are sufficient for Lemma 3.1? Three looks like a magic number after reading the paper. L90-92 you explain the known results that a single tree metric does not suffice, but why three trees? What are the space requirements of the proposed algorithm? L36-41: In your main contribution, you should *not* Use \tilde{O} without defining explicitly the hidden terms.