Fujishige Satoru

Satoru Fujishige

Information about the author Satoru Fujishige will soon be added to the site.
Found 23 papers in total
Matroids Are Immune to Braess’ Paradox
Matroids Are Immune to Braess’ Paradox
2017
The famous Braess paradox describes the counterintuitive phenomenon in which, in...
On the feasible payoff set of two‐player repeated games with unequal discounting
On the feasible payoff set of two‐player repeated games with unequal discounting
2013
We provide a novel characterization of the feasible payoff set of a general...
A two-sided discrete-concave market with possibly bounded side payments: An approach by discrete convex analysis
A two-sided discrete-concave market with possibly bounded side payments: An approach by discrete convex analysis
2007
The marriage model due to Gale and Shapley (1962) and the assignment model due to...
A note on Kelso and Crawford's gross substitutes condition
A note on Kelso and Crawford's gross substitutes condition
2003
In their 1982 article, Kelso and Crawford proposed a gross substitutes condition for...
Practical efficiency of maximum flow algorithms using MA orderings and preflows
Practical efficiency of maximum flow algorithms using MA orderings and preflows
2005
Fujishige proposed a polynomial-time maximum flow algorithm using maximum adjacency...
A tree partitioning problem arising from an evacuation problem in tree dynamic networks
A tree partitioning problem arising from an evacuation problem in tree dynamic networks
2005
In this paper, we present a first polynomial time algorithm for the monotone...
A polynomial-time algorithm for the generalized independent-flow problem
A polynomial-time algorithm for the generalized independent-flow problem
2004
We consider a compound problem of the generalized minimum-cost flow problem and the...
New maximum flow algorithms by maximum adjacency orderings and scaling
New maximum flow algorithms by maximum adjacency orderings and scaling
2003
Maximum adjacency (MA) ordering has effectively been applied to graph connectivity...
A maximum flow algorithm using maximum adjacency ordering
A maximum flow algorithm using maximum adjacency ordering
2003
Maximum adjacency (MA) ordering has effectively been applied to graph connectivity...
A note on Faigle and Kern's dual greedy polyhedra
A note on Faigle and Kern's dual greedy polyhedra
2000
U. Faigle and W. Kern have recently extended the work of their earlier paper and of M....
A laminarity property of the polyhedron described by a weakly posi-modular set function
A laminarity property of the polyhedron described by a weakly posi-modular set function
2000
Recently, Nagamochi and Ibaraki have introduced a concept of posi-modular set function...
Notes on L-/m-convex functions and the separation theorems
Notes on L-/m-convex functions and the separation theorems
2000
The concepts of L-convex function and M-convex function have recently been introduced...
Another simple proof of the validity of Nagamochi and Ibaraki's min-cut algorithm and Queyranne's extension to symmetric submodular function minimization
Another simple proof of the validity of Nagamochi and Ibaraki's min-cut algorithm and Queyranne's extension to symmetric submodular function minimization
1998
M. Stoer and F. Wagner and independently A. Frank have found a simple proof of the...
Balanced bisubmodular systems and bidirected flows
Balanced bisubmodular systems and bidirected flows
1997
For a nonempty finite set V let 3 V be the set of all the ordered pairs of disjoint...
On structures of bisubmodular polyhedra
On structures of bisubmodular polyhedra
1996
A bisubmodular polyhedron is defined in terms of a so-called bisubmodular function on...
The minimum-weight ideal problem for signed posets
The minimum-weight ideal problem for signed posets
1996
The concept of signed poset has recently been introduced by V. Reiner as a...
An efficient cost scaling algorithm for the independent assignment problem
An efficient cost scaling algorithm for the independent assignment problem
1995
An efficient cost scaling algorithm is presented for the independent assignment...
A greedy algorithm for minimizing a separable convex function over a finite jump system
A greedy algorithm for minimizing a separable convex function over a finite jump system
1995
The authors present a greedy algorithm for minimizing a separable convex function over...
A greedy algorithm for minimizing a separable convex function over an integral bisubmodular polyhedron
A greedy algorithm for minimizing a separable convex function over an integral bisubmodular polyhedron
1994
The authors present a new greedy algoritm for minimizing a separable convex function...
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions
1992
Recently, Frank and Tardos presented an algorithm, called the bi-truncation algorithm,...
A dual algorithm for finding the minimum-norm point in a polytope
A dual algorithm for finding the minimum-norm point in a polytope
1990
The authors give a dual algorithm for the problem of finding the minimum-norm point in...
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
1988
A greedy algorithm solves the problem of maximizing a linear objective function over...
A strongly polynomial algorithm for minimum cost submodular flow problems
A strongly polynomial algorithm for minimum cost submodular flow problems
1989
The only known strongly polynomial algorithm for solving minimum cost submodular flow...
Papers per page: