Voronoi Diagram
-
T. Ohya, M. Iri and K. Murota (1984):
A fast Voronoi-diagram algorithm with quaternary tree bucketing,
Information Processing Letters, 18, 227-231.
-
M. Iri, K. Murota and T. Ohya (1984):
A fast Voronoi-diagram algorithm with applications to geographical
optimization problems,
In System Modelling and Optimization (P. Thoft-Christensen, ed.)
Lecture Notes in Control and Information Sciences, 59, Springer,
1984, 273-288.
-
T. Ohya, M. Iri and K. Murota (1984):
Improvements of the incremental method for the Voronoi diagram with
computational comparison of various algorithms,
Journal of the Operations Research Society of Japan, 27, 306-337.
-
H. Imai, M. Iri and K. Murota (1985):
Voronoi diagram in the Laguerre geometry and its applications,
SIAM Journal on Computing, 14, 93-105.
-
T. Asano, M. Edahiro, H. Imai, M. Iri and K. Murota (1985):
Practical use of bucketing techniques in computational geometry,
Computational Geometry, G. T. Toussaint ed., North-Holland,
1985, 153-195.
-
M. Iri, K. Kubota and K. Murota (1991):
Geometrical/geographical optimization and fast automatic differentiation,
Yugoslav Journal of the Operations Research, 1, 121-134.
Graph, Newtork, Matroid, Discrete Optimization
-
M. Iri, K. Murota and S. Matsui (1981):
Linear-time approximation algorithms for finding the minimum-weight
perfect matching on a plane,
Information Processing Letters, 12, 206-209.
-
M. Iri, K. Murota and S. Matsui (1982):
An approximate solution for the problem of optimizing the plotter pen
movement,
In System Modelling and Optimization (R.F.Drenick and F. Kozin, eds.)
Lecture Notes in Control and Information Sciences, 38, Springer,
1982, pp. 572-580.
-
M. Iri, K. Murota and S. Matsui (1983):
Heuristics for planar minimum-weight perfect matchings,
Networks, 13, 67-92.
-
K. Murota (1987):
Homotopy base of acyclic graphs---A combinatorial
analysis of commutative
diagrams by means of preordered matroid,
Discrete Applied Mathematics, 17, 135-155.
-
K. Murota and S. Fujishige (1987):
Finding a homotopy base for directed paths in an acyclic graph,
Discrete Applied Mathematics, 17, 157-162.
-
K. Murota (1988):
Note on the universal bases of a pair of
polymatroids, Journal of the Operations Research Society of Japan,
31, 565-572.
-
S. Iwata, K. Murota and M. Shigeno (1997):
A fast submodular intersection algorithm for strong map sequences,
Mathematics of Operations Research,
22, 803-813.
-
T. Suzuki. S. Aoki and K. Murota (2005):
Use of primal-dual technique in the network algorithm
for two-way contingency tables,
Japan Journal of Industrial and Applied Mathematics,
22, 133-145.
-
H. Hirai, K. Murota, and M. Rikitoku (2005):
SVM kernel by electric network,
Pacific Journal of Optimization,
1, 509-526.
-
H. Saito and K. Murota (2007):
Benders decomposition approach to robust mixed integer programming,
Pacific Journal of Optimization,
3, 99-112.
-
H. Hirai, K. Murota, and M. Rikitoku (2007):
Electric network classifiers for semi-supervised learning on graphs,
Journal of the Operations Research Society of Japan,
50, 218-231.
-
K. Otsuki, Y. Kobayashi, and K. Murota (2015):
Improved max-flow min-cut algorithms in a circular disk failure model
with application to a road network,
European Journal of Operational Research,
to appear.