5 citations · 11 across the 22 of their papers we have counts for
Showing 2023 · cs.DSShow all
2 papers · 2 filters
cs.DS2023
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…
cs.DS2023★ 1 cited
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…