Reproduce “Totally $Δ$-modular IPs with two non-zeros in most rows” 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
Stefan Kober
Kober proves an exact strongly polynomial-time algorithm for integer programs whose constraint matrices have bounded subdeterminants and a sparse core with at most two nonzero entries per row. The method allows fixed numbers of linking rows and columns and uses graph decomposition and dynamic programming. The result applies when the determinant bound and numbers of added rows and columns are fixed.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.