2 citations · 4 across the 19 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019★ 1 cited
-Gather Clustering and -Gathering on Spider: FPT Algorithms and Hardness
Soh Kumabe, Takanori Maehara
We consider min-max -gather clustering problem and min-max -gathering problem. In the min-max -gather clustering problem, we are given a set of users and divide them into…
cs.DS2019
PTAS and Exact Algorithms for -Gathering Problems on Tree
Soh Kumabe, Takanori Maehara
r-gathering problem is a variant of facility location problems. In this problem, we are given a set of users and a set of facilities on same metric space. We open some of the facil…
cs.DS2019
Incorrect implementations of the Floyd--Warshall algorithm give correct solutions after three repeats
Ikumi Hide, Soh Kumabe, Takanori Maehara
The Floyd--Warshall algorithm is a well-known algorithm for the all-pairs shortest path problem that is simply implemented by triply nested loops. In this study, we show that the i…