Algorithms to solve the knapsack constrained maximum spanning tree problem

Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka. Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. J. Comput. Math., 82(1):23-34, 2005. [doi]

Authors

Takeo Yamada

This author has not been identified. Look up 'Takeo Yamada' in Google

Kohtaro Watanabe

This author has not been identified. Look up 'Kohtaro Watanabe' in Google

Seiji Kataoka

This author has not been identified. Look up 'Seiji Kataoka' in Google