5 citations · 11 across the 22 of their papers we have counts for
4 papers · 1 filter
Loss Minimization for Electrical Flows over Spanning Trees on Grids
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2
We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and r…
Reconfiguration of labeled matchings in triangular grid graphs
Naonori Kakimura, Yuta Mishima
This paper introduces a new reconfiguration problem of matchings in a triangular grid graph. In this problem, we are given a nearly perfect matching in which each matching edge is…
On Approximating the Weighted Region Problem in Square Tessellations
Naonori Kakimura, Rio Katsu
The weighted region problem is the problem of finding the weighted shortest path on a plane consisting of polygonal regions with different weights. For the case when the plane is t…
Parameterized Complexity of Submodular Minimization under Uncertainty
Naonori Kakimura, Ildikó Schlotter
This paper studies the computational complexity of a robust variant of a two-stage submodular minimization problem that we call Robust Submodular Minimizer. In this problem, we are…