1 citations · 1 across the 4 of their papers we have counts for
4 papers
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…
Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays
Naonori Kakimura, Tomohiro Nakayoshi
In this paper, we study the Min-cost Perfect -way Matching with Delays (-MPMD), recently introduced by Melnyk et al. In the problem, requests arrive one-by-one over time…
Algorithmic Theory of Qubit Routing
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2
The qubit routing problem, also known as the swap minimization problem, is a (classical) combinatorial optimization problem that arises in the design of compilers of quantum progra…
Reforming an Envy-Free Matching
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura +5
We consider the problem of reforming an envy-free matching when each agent is assigned a single item. Given an envy-free matching, we consider an operation to exchange the item of…