#### Filter Results:

- Full text PDF available (0)

#### Publication Year

2004

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hiroshi Nagamochi, Taizo Kawada
- Discrete Applied Mathematics
- 2006

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)

- Hiroshi Nagamochi, Taizo Kawada
- ISAAC
- 2004

- ‹
- 1
- ›