1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows –Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
2. Connamacher, H.S., Proskurowski, A.: The complexity of minimizing certain cost metrics for k-source spanning trees. Discrete Applied Mathematics 131, 113–127 (2003)
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithm, 2nd edn. MIT Press, Cambridge (2001)
4. Farley, A.M., Fragopoulou, P., Krumme, D.W., Proskurowski, A., Richards, D.: Multi-source spanning tree problems. Journal of Interconnection Networks 1, 61–71 (2000)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)