1. Andrews, M., Antonakopoulos, S., Zhang, L.: Minimum-cost network design with (Dis)economies of scale. In: Proceedings, IEEE Foundations of Computer Science (FOCS), pp. 585–592 (2010)
2. Atamturk, A.: On capacitated network design cut-set polyhedra. Math. Program. 92, 425–437 (2002)
3. Berman, P., Coulston, C.: On-line algorithms for steiner tree problems (extended abstract). In: Proceedings, ACM Symposium on Theory of Computation (STOC), pp. 344–353 (1997)
4. Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 106–115 (2000)
5. Chakrabarty, D., Krishnaswamy, R., Li, S., Narayanan, S.: Capacitated network design in undirected graphs. Unpublished Manuscript as of April 2013