2 citations · 2 across the 3 of their papers we have counts for
3 papers
4-Block Integer Programming is in FPT
Martin Koutecký, Alexandra Lassota, Koen Ligthart
Integer programming is a fundamental and important NP-hard problem. This motivated extensive efforts in studying several tractable subclasses. One of the top unresolved complexity…
Tight Lower Bounds for Block-Structured Integer Programs
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký +2
We study fundamental block-structured integer programs called tree-fold and multi-stage IPs. Tree-fold IPs admit a constraint matrix with independent blocks linked together by few…
Parameterized algorithms for block-structured integer programs with large entries
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota +2
We study two classic variants of block-structured integer programming. Two-stage stochastic programs are integer programs of the form $\{A_i \mathbf{x} + D_i \mathbf{y}_i = \mathbf…