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.
Title resolution pending
1 Pith paper cite this work, alongside 16 external citations. Polarity classification is still indexing.
1
Pith paper citing it
16
external citations · OpenAlex
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 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.