Reproduce “Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter” 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
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.