A Steinitz-lemma-based algorithm solves combinatorial n-fold ILPs with unbounded non-negative variables, giving 2^{O(k^2)}-time algorithms for Lobbying and Binary Closest String.
On the Power of Linear Dependencies , pages 31--45
1 Pith paper cite this work, alongside 34 external citations. Polarity classification is still indexing.
1
Pith paper citing it
34
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma
A Steinitz-lemma-based algorithm solves combinatorial n-fold ILPs with unbounded non-negative variables, giving 2^{O(k^2)}-time algorithms for Lobbying and Binary Closest String.