Similar Items: Accelerated Relax-and-Round for Concave Coverage Problems
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
- Distributed Santa Claus via Global Rounding
- An $widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
- Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
- Towards Settling the Complexity of the Lettericity Problem
- Handicap reduction for linear complementarity problems