13 citations · 19 across the 9 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2014★ 1 cited
Extended Formulations for Sparsity Matroids
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh +2
We show the existence of a polynomial-size extended formulation for the base polytope of a -sparsity matroid. For an undirected graph , the size of the formulati…
math.CO2000★ 3 cited
A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions
Satoru Iwata, Lisa Fleischer, Satoru Fujishige
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Sc…