1. , , Network Flows—Theory, Algorithms, and Applications, Prentice–Hall, Englewood Cliffs, NJ, 1993.
2. The complexity of minimizing certain cost metrics for k-source spanning trees
3. , , , Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA, 2001.
4. MULTI-SOURCE SPANNING TREE PROBLEMS
5. , Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, San Francisco, CA, 1979.