Sparse integer programming is FPT

MaRDI QIDQ5071029zbMATH OpenFDO

Authors Martin Koutecký, Shmuel Onn

Publication date 19 April 2022

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/660

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Integer programming (90C10)

Recommendations

• FPT-algorithms for some problems related to integer programming
• Fast integer programming in fixed dimension
• On polynomial kernels for sparse integer linear programs
• Parametric integer programming in fixed dimension
• Integer programming in parameterized complexity: five miniatures

Cited in

(7)

• Using structural properties for integer programs
• FPT-algorithms for some problems related to integer programming
• The complexity of vector partition
• Integer programming in parameterized complexity: three miniatures
• Asymptotic behavior of Markov complexity
• Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
• Circuit and Graver walks and linear and integer programming

This page was built for publication: Sparse integer programming is FPT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071029)