Reproduce “Smallest Multiplicative Stretch for an $α$-APASP Below $\widetilde O \left(n^ω\right)$ Runtime” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Lakshay Saggi, Ariel Sapir
The authors present randomized algorithms that, with high probability, estimate every pairwise shortest-path distance in weighted undirected graphs within a factor of 2. For dense graphs with positive integer edge weights bounded by Wmax, the faster algorithm runs in Õ(n^2.17157288 log^2 Wmax); a weight-range-independent alternative runs in Õ(n^2.34549151). Both are theoretical operation-count bounds, and the faster bound does not apply to arbitrary real weights.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.