2 citations · 4 across the 19 of their papers we have counts for
4 papers · 1 filter
Max-Distance Sparsification for Diversification and Clustering
Soh Kumabe
Let be a set family that is the solution domain of some combinatorial problem. The \emph{max-min diversification problem on } is the problem to select $k…
Average sensitivity of the Knapsack Problem
Soh Kumabe, Yuichi Yoshida
In resource allocation, we often require that the output allocation of an algorithm is stable against input perturbation because frequent reallocation is costly and untrustworthy.…
Lipschitz Continuous Allocations for Optimization Games
Soh Kumabe, Yuichi Yoshida
In cooperative game theory, the primary focus is the equitable allocation of payoffs or costs among agents. However, in the practical applications of cooperative games, accurately…
Complexity of graph-state preparation by Clifford circuits
Soh Kumabe, Ryuhei Mori, Yusei Yoshimura
In this work, we study the complexity of graph-state preparation in a general model of quantum algorithms that allows measurements in the computational basis, single-qubit Clifford…