Reproduce “Improved Quasi-Polynomial-Time Approximation for Maximum Independent Set” 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
Zhao Song
The authors give a deterministic quasi-polynomial-time algorithm for maximum independent set by finding a large sparse vertex region and greedily extracting an independent set. For an N-vertex graph with α(G)≥2^-t N, it finds at least 2^t vertices in time N^O(t). Choosing t near √log N yields ratio N/2^Ω(√log N). The stated relaxation-based limit applies to universal implications, not all algorithms.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.