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]
@article{YamadaWK05,
title = {Algorithms to solve the knapsack constrained maximum spanning tree problem},
author = {Takeo Yamada and Kohtaro Watanabe and Seiji Kataoka},
year = {2005},
doi = {10.1080/00207160412331290667},
url = {http://dx.doi.org/10.1080/00207160412331290667},
researchr = {https://researchr.org/publication/YamadaWK05},
cites = {0},
citedby = {0},
journal = {Int. J. Comput. Math.},
volume = {82},
number = {1},
pages = {23-34},
}