Note on time bounds of two-phase algorithms for L-convex function minimization

Abstract

We analyze minimization algorithms, called the two-phase algorithms, for L\(^{\natural }\)-convex functions in discrete convex analysis and derive tight bounds for the number of iterations.