Name FUJISHIGE, Satoru
Position Professor Emeritus
E-Mail fujishig (email address: add @kurims.kyoto-u.ac.jp)
Satoru Fujishige is working on combinatorial optimization and discrete algorithms related to graphs, networks, matroids, and submodular functions. He has been developing the theory of submodular functions to give a mathematical basis for analyzing combinatorial optimization problems with submodularity structures and devising efficient algorithms for such combinatorial optimization problems. His recent research interests are in the dual greedy structures of a certain class of combinatorial optimization problems that generalize the submodularity structure. He is also interested in the problem of finding strongly polynomial algorithms for generalized network flows and linear programming problems and has recently proposed a new practical algorithm called the LP-Newton method.