A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs

@inproceedings{Kouteck2018APS,
  title={A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs},
  author={M. Kouteck{\'y} and Asaf Levin and S. Onn},
  booktitle={ICALP},
  year={2018}
}
The theory of $n$-fold integer programming has been recently emerging as an important tool in parameterized complexity. The input to an $n$-fold integer program (IP) consists of parameter $A$, dimension $n$, and numerical data of binary encoding length $L$. It was known for some time that such programs can be solved in polynomial time using $O(n^{g(A)}L)$ arithmetic operations where $g$ is an exponential function of the parameter. In 2013 it was shown that it can be solved in fixed-parameter… Expand
45 Citations
An Algorithmic Theory of Integer Programming
  • 36
  • PDF
Evaluating and Tuning n-fold Integer Programming
  • 13
  • PDF
Combinatorial n-fold integer programming and applications
  • 5
  • PDF
N-fold integer programming via LP rounding
  • 5
  • PDF
Parameterized Algorithms for MILPs with Small Treedepth
  • 1
  • PDF
On the Graver basis of block-structured integer programming
  • 6
  • Highly Influenced
  • PDF
Evaluating and Tuning n-fold Integer Programming
  • 1
  • PDF
A row-invariant parameterized algorithm for integer programming
  • 3
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Combinatorial n-fold integer programming and applications
  • 5
  • PDF
n-Fold integer programming in cubic time
  • 63
  • PDF
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
  • É. Tardos
  • Mathematics, Computer Science
  • Oper. Res.
  • 1986
  • 457
A Faster Parameterized Algorithm for Treedepth
  • 46
  • PDF
...
1
2
3
4
...