OpenResearch

Reproduce “Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Download for macOS

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perković, André Van Renssen

Read on alphaXiv

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