WorldCat Identities

Iwata, Satoru

Overview
Works: 21 works in 50 publications in 4 languages and 331 library holdings
Genres: Conference papers and proceedings 
Roles: Author
Classifications: QA76.952, 330.0182
Publication Timeline
.
Most widely held works by Satoru Iwata
A minimax theorem and a Dulmage-Mendelsohn type decomposition for a class of generic partitioned matrices by Satoru Iwata( Book )

8 editions published in 1993 in English and German and held by 13 WorldCat member libraries worldwide

A faster capacity scaling algorithm for minimum cost submodular flow by Lisa Fleischer( Book )

6 editions published in 1999 in English and held by 11 WorldCat member libraries worldwide

Abstract: "We describe an O(n⁴h min[log U, n² log n]) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds-Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter [delta]. Capacities are relaxed by attaching a complete directed graph with uniform arc capacity [delta] in each scaling phase. We then modify a feasible submodular flow by relaxing the submodular constraints, so that complementary slackness is satisfied. This creates discrepancies between the boundary of the flow and the base polytope of a relaxed submodular function. To reduce these discrepancies, we use a variant of the successive shortest path algorithm that augments flow along min cost paths of residual capacity at least [delta]. The shortest augmenting path subroutine we use is a variant of Dijkstra's algorithm modified to handle exchange capacity arcs efficiently. The result is a weakly polynomial time algorithm whose running time is better than any existing submodular flow algorithm when U is small and C is big. We also show how to use max mean cuts to make the algorithm strongly polynomial. The resulting algorithm is the first capacity scaling algorithm to match the current best strongly polynomial bound for submodular flow."
A strongly polynomial-time algorithm for minimizing submodular functions by Satoru Iwata( Book )

6 editions published in 1999 in English and held by 11 WorldCat member libraries worldwide

Abstract: "This paper presents a combinatorial polynomial-time algorithm for minimizing submodular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter. The resulting algorithm runs in time bounded by a polynomial in the size of the underlying set and the largest length of the function value. The paper also presents a strongly polynomial-time version that runs in time bounded by a polynomial in the size of the underlying set independent of the function value. These are the first combinatorial algorithms for submodular function minimization that run in (strongly) polynomial time."
A theorem on the principal structure for independent matchings by Satoru Iwata( Book )

5 editions published in 1993 in English and German and held by 9 WorldCat member libraries worldwide

The linear delta-matroid parity problem by James F Geelen( Book )

3 editions published in 1997 in English and held by 6 WorldCat member libraries worldwide

Abstract: "This paper addresses a generalization of the matroid parity problem to delta-matroids. We give a minimax relation, as well as an efficient algorithm, for linearly represented delta-matroids. These are natural extensions of the minimax theorem of L. Lovász and the augmenting path algorithm of H. Gabow and M. Stallmann for the linear matroid parity problem."
Combinatorial optimization and discrete algorithms : June 9-13, 2008 by RIMS Workshop on Combinatorial Optimization and Discrete Algorithms( Book )

3 editions published in 2010 in English and held by 5 WorldCat member libraries worldwide

Senkei keisan no sūri by Masāki Sugihara( Book )

1 edition published in 2009 in Japanese and held by 4 WorldCat member libraries worldwide

A theorem on the principal structure for independent matchings by Satoru Iwata( Book )

1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide

A simple combinatorial algorithm for submodular function minimization by Satoru Iwata( Book )

2 editions published in 2008 in English and held by 3 WorldCat member libraries worldwide

Ōritchi kūkan to sono ōyō by Hirō Kita( Book )

1 edition published in 2009 in Japanese and held by 2 WorldCat member libraries worldwide

Seisoku kansū no nasu hiruberuto kūkan by Takahiko Nakaji( Book )

1 edition published in 2009 in Japanese and held by 2 WorldCat member libraries worldwide

Tokui sekibun by Kōzō Yabuta( Book )

1 edition published in 2010 in Japanese and held by 2 WorldCat member libraries worldwide

A faster capacity scaling algorithm for minimum cost submodular flow( )

1 edition published in 1999 in English and held by 1 WorldCat member library worldwide

The 11th Hungarian-Japanese symposium on discrete mathematics and its applications : May 27-30, 2019, Tokyo, Japan( Book )

1 edition published in 2019 in English and held by 1 WorldCat member library worldwide

Hōbutsugata hatten hōteishiki to sono ōyō( Book )

1 edition published in 2011 in Japanese and held by 1 WorldCat member library worldwide

A strongly polynomial-time algorithm for minimizing submodular functions( )

1 edition published in 1999 in English and held by 1 WorldCat member library worldwide

Submodular function minimization under covering constraints by Satoru Iwata( Book )

1 edition published in 2009 in English and held by 1 WorldCat member library worldwide

Bisubmodular function minimization by Satoru Fujishige( Book )

1 edition published in 2000 in English and held by 1 WorldCat member library worldwide

Hōbutsugata hatten hōteishiki to sono ōyō( Book )

1 edition published in 2011 in Japanese and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.40 (from 0.26 for Ask Iwata ... to 0.96 for A simple c ...)

Covers
Alternative Names
Iwata, S.

Iwata, Satoru

イワタ, サトル

Languages