2 citations · 4 across the 19 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
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…
cs.DS2020
Interval Query Problem on Cube-free Median Graphs
Soh Kumabe
In this paper, we introduce the \emph{interval query problem} on cube-free median graphs. Let be a cube-free median graph and be a commutative semigroup. For each…