1. Designing hierarchical survivable networks;Balakrishnan;Oper. Res.,1998
2. A. Balakrishnan, T.L. Magnanti, P. Mirchandani, 2000. Connectivity-splitting models for survivable network design, Working Paper 00-3, Department of Management Science & Information Systems, Pennsylvania State University.
3. Edmonds, J. Maximum matching and a Polyhedron with 0–1 vertices, J. Res. Nat. Bureau Standards, 69B (1965) 125–130.
4. Survivable networks, linear programming relaxations and the parsimonious property;Goemans;Math. Programming,1993
5. M.X. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, D.P. Williamson, Approximation schemes for network design problems, Proceedings of the Fifth Annual ACM/SIAM Symposium on Discrete Algorithms, Arlington, VA, 1994, pp. 223–232.