Reproduce “First Near-Additive All-Pairs Approximate Shortest Paths in Decremental Weighted Graphs” 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

Eden Koveshi, Liam Roditty, Ariel Sapir

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.