Optimization Online


A Note on Submodular Function Minimization by Chubanov's LP Algorithm

Satoru Fujishige (fujishig***at***kurims.kyoto-u.ac.jp)

Abstract: Recently Dadush, Vegh, and Zambelli (2017) has devised a polynomial submodular function minimization (SFM) algorithm based on their LP algorithm. In the present note we also show a weakly polynomial algorithm for SFM based on the recently developed linear programming feasibility algorithm of Chubanov (2017). Our algorithm is different from Dadush, Vegh, and Zambelli's but is similar to theirs in ideas because both algorithms are based on recent geometric rescaling LP algorithms.

Keywords: Submodular function minimization, base polyhedra, Chubanov's algorithm

Category 1: Combinatorial Optimization (Graphs and Matroids )



Entry Submitted: 09/21/2017
Entry Accepted: 09/22/2017
Entry Last Modified: 11/20/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society