Approximation algorithms for integer programming with resource augmentation

The classic algorithm [Papadimitriou, J.ACM '81] for IPs has a running time $n^{O(m)}(m\cdot\max\{Δ,\|\textbf{b}\|_{\infty}\})^{O(m^2)}$, where $m$ is the number of constraints, $n$ is the number of variables, and $Δ$ and $\|\textbf{b}\|_{\infty}$ are, respectively, the largest absolute values among... View More