Integer programs with nearly totally unimodular matrices: the cographic case

DOI10.1137/1.9781611978322.76MaRDI QIDQ7289643zbMATH OpenFDO

Authors Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Miehał T. Seweryn, Stefan Weltge, Yelena Yuditsky

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978322.76

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• A threshold phenomenon for the shortest lattice vector problem in the infinity norm
• Arithmetic circuits and neural networks for regular matroids
• Parameterized algorithms for matching integer programs with additional rows and columns
• The red-blue-yellow matching problem
• Mathematical programming approaches for social welfare maximization

This page was built for publication: Integer programs with nearly totally unimodular matrices: the cographic case

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