The complexity of minimizing certain cost metrics for k-source spanning trees.

Harold S. Connamacher Andrzej Proskurowski The complexity of minimizing certain cost metrics for k-source spanning trees. 113-127 2003 131 Discrete Applied Mathematics 1 http://dx.doi.org/10.1016/S0166-218X(02)00420-1 db/journals/dam/dam131.html#ConnamacherP03