Kazuo Murota
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Kazuo Murota has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Maiko Shigeno
Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki 305, Japan
1 shared publication - Satoru Fujishige
Research Institute for Mathematical Sciences Kyoto University 606-8502 Kyoto Japan
1 shared publication - Satoru Iwata
University of Tokyo
1 shared publication - Satoru Iwata
The University of Tokyo
1 shared publication
Latest Publications
- 1 April 2001
- Published by Springer Nature in Mathematical Programming
- Vol. 90 (2) , 353-371
Combinatorial relaxation algorithm for mixed polynomial matrices
- 1 April 2001
- Published by Springer Nature in Mathematical Programming
- Vol. 90 (2) , 353-371
Combinatorial relaxation algorithm for mixed polynomial matrices
- 1 June 2000
- Published by Springer Nature in Mathematical Programming
- Vol. 88 (1) , 129-146
Notes on L-/M-convex functions and the separation theorems
- 1 June 2000
- Published by Springer Nature in Mathematical Programming
- Vol. 88 (1) , 129-146
Notes on L-/M-convex functions and the separation theorems
- 1 January 1999
- Published by Springer Nature in Combinatorica
- Vol. 19 (1) , 87-109
Submodular Flow Problem with a Nonseparable Cost Function
- 1 January 1999
- Published by Springer Nature in Combinatorica
- Vol. 19 (1) , 87-109
Submodular Flow Problem with a Nonseparable Cost Function
- 1 August 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (3) , 357-375
Fenchel-type duality for matroid valuations
- 1 August 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (3) , 357-375
Fenchel-type duality for matroid valuations
- 1 January 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1-3) , 313-371
Discrete convex analysis
- 1 January 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1-3) , 313-371
Discrete convex analysis
- 1 November 1997
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 22 (4) , 803-813
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
This paper presents a fast algorithm to solve the intersection problem for a pair of nondecreasing and nonincreasing strong map sequences of submodular systems. The worst-case time bound is the same as that of the push/relabel algorithm for a single intersection problem. This extends the Gallo-Grigoriadis-Tarjan (GGT) method for parametric maximum flow problems and reveals an algorithmic significance of the concept of strong maps for submodular systems.
- 1 November 1997
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 22 (4) , 803-813
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
This paper presents a fast algorithm to solve the intersection problem for a pair of nondecreasing and nonincreasing strong map sequences of submodular systems. The worst-case time bound is the same as that of the push/relabel algorithm for a single intersection problem. This extends the Gallo-Grigoriadis-Tarjan (GGT) method for parametric maximum flow problems and reveals an algorithmic significance of the concept of strong maps for submodular systems.
- Open Access
- 1 January 1997
- Published by The Operations Research Society of Japan in Journal of the Operations Research Society of Japan
- Vol. 40 (4) , 565-578
CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
Abstmct Two characterizations are given fbr a valuated delta-matroid. Let (V,T) be an even delta-matroid on a finite set V with the farni]y JIr of feasible sets, It is shown that a function 6 : lr-R is a valuation of (V, f) if and only if, for each linear weight,ing p : V-} R, the maximizers ef 6 +p form the family of feaslble sets of a delta-matroid, It is also shown that 6 is a valuation if and only if its conjugate function is "]ocally bisubmodular" at each point.
- 1 January 1997
- Published by The Operations Research Society of Japan in Journal of the Operations Research Society of Japan
- Vol. 40 (4) , 565-578
Open AccessCHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
Abstmct Two characterizations are given fbr a valuated delta-matroid. Let (V,T) be an even delta-matroid on a finite set V with the farni]y JIr of feasible sets, It is shown that a function 6 : lr-R is a valuation of (V, f) if and only if, for each linear weight,ing p : V-} R, the maximizers ef 6 +p form the family of feaslble sets of a delta-matroid, It is also shown that 6 is a valuation if and only if its conjugate function is "]ocally bisubmodular" at each point.
- 1 December 1996
- Published by Springer Nature in Combinatorica
- Vol. 16 (4) , 591-596
On exchange axioms for valuated matroids and valuated delta-matroids
- 1 December 1996
- Published by Springer Nature in Combinatorica
- Vol. 16 (4) , 591-596
On exchange axioms for valuated matroids and valuated delta-matroids
- 1 June 1995
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 222, 261-274
An identity for bipartite matching and symmetric determinant
- 1 June 1995
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 222, 261-274
An identity for bipartite matching and symmetric determinant