Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting

Dmitry Gribanov, Tagir Khayaleyev, Mikhail Cherniavskii +3

We study the standard-form ILP problem $\max \{c^{\top }x:Ax=b,x\in Z_{\ge 0}^n\}$, where $A\in Z^{k\times n}$ has full row rank. We obtain refined FPT algorithms par…