Similar Items: An $widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
- Matroid Algorithms Under Size-Sensitive Independence Oracles
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
- A note on the parameter $ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
- Distributed Santa Claus via Global Rounding
- Accelerated Relax-and-Round for Concave Coverage Problems
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth