Near-linear scaling-based algorithms solve separable convex integer programs in small-treedepth regimes, matching the n log(range) comparison lower bound up to parameters and a log n gap.
European Journal of Operational Research190(1), 1–21 (2008)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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
-
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
Near-linear scaling-based algorithms solve separable convex integer programs in small-treedepth regimes, matching the n log(range) comparison lower bound up to parameters and a log n gap.