arXiv · 2611.11046
Integer Programming Parametrized by Imbalanced Circuit Packing
Abstract
We study the standard form Integer Programming problem (IP) parametrized by the imbalanced circuit packing number. This number is $0$ if and only if $A$ can be transformed to a totally unimodular matrix by row operations, in which case (IP) is solvable in polynomial time. We show that if the constraint matrix represents a graphic matroid, (IP) is fixed-parameter tractable when parametrized by the imbalanced circuit packing number of the matrix. The proof combines an Erdős-Pósa property for edge-colored non-monochromatic cycles with a reduction to mixed-integer programming using few integer variables. In contrast, by a reduction from the parity potential problem, we show NP-completeness of feasibility of (IP) when the constraint matrix represents a cographic matroid, even if kernel of the constraint matrix is $2$-regular and imbalanced circuits pairwise intersect.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yuheng Shi. 2026-11-15. Integer Programming Parametrized by Imbalanced Circuit Packing. https://searcharxiv.com/abs/2611.11046
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.