1 citations · 1 across the 4 of their papers we have counts for
5 papers
r-Gathering Problems on Spiders:Hardness, FPT Algorithms, and PTASes
Soh Kumabe, Takanori Maehara
We consider the min-max -gathering problem described as follows: We are given a set of users and facilities in a metric space. We open some of the facilities and assign each use…
-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…
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…
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…
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
Soh Kumabe, Takanori Maehara, Ryoma Sin'ya
The automaton constrained tree knapsack problem is a variant of the knapsack problem in which the items are associated with the vertices of the tree, and we can select a subset of…