Reproduce “A polynomial-time $\text{OPT}^ε$-approximation algorithm for maximum independent set of connected subgraphs in a planar graph” on OpenResearch

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

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