1. Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 106–115 (2000)
2. Even, G., Kortsarz, G., Slany, W.: On network design problems: fixed cost flows and the covering steiner problem. ACM Trans. Algorithms 1(1), 74–101 (2005)
3. Franklin, M.K.: Complexity and security of distributed protocols. PhD thesis, Dept. of Computer Science, Columbia University (1994)
4. Garey, M., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman (1979)
5. Garg, N., Ravi, R., Konjevod, G.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1) (2000)