3 citations · 5 across the 4 of their papers we have counts for
5 papers
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem
Satoru Fujishige, Tomonari Kitahara, László A. Végh
We consider the minimum-norm-point (MNP) problem over polyhedra, a well-studied problem that encompasses linear programming. We present a general algorithmic framework that combine…
Compression of M-convex Functions -- Flag Matroids and Valuated Permutohedra
Satoru Fujishige, Hiroshi Hirai
Murota (1998) and Murota and Shioura (1999) introduced concepts of M-convex function and M-convex function as discrete convex functions, which are generalizations of v…
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids
Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi
The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete…
Matroids are Immune to Braess Paradox
Satoru Fujishige, Michel X. Goemans, Tobias Harks +2
The famous Braess paradox describes the following phenomenon: It might happen that the improvement of resources, like building a new street within a congested network, may in fact…
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…