A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs

@inproceedings{Kouteck2018APS,
  title={A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs},
  author={Martin Kouteck{\'y} and Asaf Levin and Shmuel 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(ng(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 tractable time… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS
4 Citations
30 References
Similar Papers

Similar Papers

Loading similar papers…