Reproduce “A Constant-Factor Approximation for Capacitated Facility Location with Outliers” 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
Rajni Dabas
The authors give a deterministic polynomial-time approximation for metric capacitated facility location with outliers, unit-demand clients, arbitrary opening costs, and nonuniform hard capacities. The method searches over a common rejection penalty, uses signed rejection-count comparisons, and merges solutions bracketing the quota. It guarantees cost at most 60/11 + ε times optimum, for 0 < ε ≤ 1; this is a worst-case bound, not a runtime claim.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.