Taizo Kawada

  • Citations Per Year
Learn More
LetG= (V ,E) be a connected graph such that edges and vertices are weighted by nonnegative reals. Let p be a positive integer. The minmax subtree cover problem (MSC) asks to find a pair (X,T) of a partition X = {X1, X2, . . . , Xp} of V and a set T of p subtrees T1, T2, . . . , Tp , each Ti containing Xi so as to minimize the maximum cost of the subtrees,(More)
  • 1