On survivable network polyhedra

Discrete Mathematics

Volumn 290, Issue 2-3, 2005, Pages 183-210

  Kerivin, Hervé ^a,b   Mahjoub, Ali Ridha ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Cut; Polyhedron; Polynomial algorithm; Series parallel graph; Survivable network

Indexed keywords

ALGORITHMS; GRAPH THEORY; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

CUT; POLYHEDRONS; POLYNOMIAL ALGORITHMS; SERIES-PARALLEL GRAPHS; SURVIVABLE NETWORKS;

COMPUTER NETWORKS;

EID: 14544275853     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.08.017     Document Type: Article

References (43)

1. M. Aggarwal, N. Garg, A scaling technique for better network design, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 233-240.
2. A. Agrawal, P. Klein, and R. Ravi When trees collide an approximation algorithm for the generalized Steiner problem in networks SIAM J. Comput. 24 1995 440 456
3. M. Baïou On the dominant of the Steiner 2-edge connected subgraph polytope Discrete Appl. Math. 112 2001 3 10
4. M. Baïou, and A.R. Mahjoub Steiner 2-edge connected subgraph polytopes on series-parallel graphs SIAM J. Discrete Math. 10 1997 505 514
5. F. Barahona, and A.R. Mahjoub On two-connected subgraph polytopes Discrete Math. 147 1995 19 34
6. S.C. Boyd, and T. Hao An integer polytope related to the design of survivable communication networks SIAM J. Discrete Math. 6 1993 612 630
7. S. Chopra The k -edge connected spanning subgraph polyhedron SIAM J. Discrete Math. 7 1994 231 246
8. S. Chopra, and M.R. Rao The Steiner tree problem I formulations, compositions and extension of facets Math. Programming 64 1994 209 229
9. S. Chopra, and M.R. Rao The Steiner tree problem II properties and classes of facets Math. Programming 64 1994 231 246
10. W. Chou, and H. Frank Survivable communication networks and the terminal capacity matrix IEEE Trans. Circuit Theory CT-17 1970 192 197
11. W. Chou, and H. Frank Connectivity considerations in the design of survivable networks IEEE Trans. Circuit Theory CT-17 1970 486 490
12. G. Cornuéjols, J. Fonlupt, and D. Naddef The traveling salesman problem on a graph and some related integer polyhedra Math. Programming 33 1985 1 27
13. C.R. Coullard, A. Rais, R.L. Rardin, D.K. Wagner. The 2-connected Steiner subgraph polytope for series-parallel graphs, Technical Report 91-32, School of Industrial Engineering, Purdue University, West Lafayette, Indiana, 1991.
14. C.R. Coullard, A. Rais, R.L. Rardin, and D.K. Wagner Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs Networks 23 1993 195 206
15. 4 -free graphs Discrete Appl. Math. 66 1996 33 43
16. M. Didi Biha, H. Kerivin, and A.R. Mahjoub Steiner trees and polyhedra Discrete Appl. Math. 112 2001 101 120
17. M. Didi Biha, and A.R. Mahjoub k -edge connected polyhedra on series-parallel graphs Oper. Res. Lett. 19 1996 71 78
18. M. Didi Biha, and A.R. Mahjoub Steiner k -edge connected subgraph polyhedra J. Combin. Optim. 4 2000 131 144
19. E.A. Dinits Algorithm for solution of a problem of maximum flow in a network with power estimation Sov. Math. Dokl. 11 1970 1277 1280
20. J. Duffin Topology of series-parallel networks J. Math. Anal. Appl. 10 1965 303 318
21. J. Edmonds, and R.M. Karp The critical improvement in algorithmic efficiency for network flow problems J. ACM 19 1972 248 264
22. H.N. Gabow, M.X. Goemans, and D.P. Williamsom An efficient approximation algorithm for the survivable network design problem Networks and matroids; sequencing and scheduling, Math. Programming B 82 1998 13 40
23. M.X. Goemans The Steiner tree polytope and related polyhedra Math. Programming 63 1994 157 182
24. M.X. Goemans, and D.J. Bertsimas Survivable networks, linear programming and the parsimonious property Math. Programming 60 1993 145 166
25. M.X. Goemans, A.V. Goldberg, S. Plotkin, D.B. Shmoys, É. Tardos, D.P. Williamson, Improved approximation algorithms for network design problems, in: Proceedings of the Fifth Annual ACM-SIAM Annual Symposium on Discrete Algorithms, 1994, pp. 232-232.
26. M.X. Goemans, D.P. Williamson, A general approximation technique for constrained forest problems, in: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 307-316.
27. M. Grötschel, L. Lovàsz, and A. Schrijver The ellipsoid method and its consequences in combinatorial optimization Combinatorica 1 1981 169 197
28. M. Grötschel, and C.L. Monma Integer polyhedra arising from certain network design problems with connectivity constraints SIAM J. Discrete Math. 3 4 1990 502 523
29. M. Grötschel, C.L. Monma, M. Stoer, Polyhedral approaches to network survivability, in: F. Roberts, F. Hwang, C.L. Monma (Eds.), Reliability of Computer and Communication Networks, vol. 5, Series Discrete Mathematics and Computer Science, AMS/ACM, New York, 1991, pp. 121-141.
30. M. Grötschel, C.L. Monma, and M. Stoer Facets for polyhedra arising in the design of communication with low-connectivity constraints SIAM J. Optim. 2 3 1992 474 504
31. M. Grötschel, C.L. Monma, M. Stoer, Design of survivable networks, in: M.O. Ball, et al. (Eds.), Handbooks in OR & MS, vol. 7, 1995, pp. 617-671.
32. K. Jain A factor 2 approximation algorithm for the generalized Steiner network problem Combinatorica 21 2001 39 60
33. H. Kerivin, A. R. Mahjoub, C. Nocq, (1,2)-Survivable networks: facets and branch-and-cut, in: M. Grötschel (Ed.), The Sharpest Cut, MPS/SIAM on Optimization, 2004, pp. 121-152.
34. C.-W. Ko, and C.L. Monma Heuristic methods for designing highly survivable communication networks 1989 Technical Report Bellcore
35. A.R. Mahjoub Two-edge connected spanning subgraphs and polyhedra Math. Programming 63 1994 199 208
36. F. Margot, A. Prodon, and T.M. Liebling Tree polytope on 2-trees Math. Programming 63 1994 183 191
37. C.L. Monma, and D.F. Shallcross Methods for designing communication networks with certain two-connected survivability constraints Oper. Res. 37 1989 531 541
38. W.R. Pulleyblank, Private Communication, 1994.
39. K. Steiglitz, P. Weiner, and D.J. Kleitman The design of minimum-cost survivable networks IEEE Trans. Circuit Theory CT-16 1969 455 460
40. M. Stoer, Design of survivable networks, Lectures Notes in Mathematics, vol. 1531, Springer, Berlin, 1992.
41. D.P. Williamson, M.X. Goemans, M. Mihail, and V.V. Vazirani A primal-dual approximation algorithm for generalized Steiner network problems Combinatorica 15 1995 435 454
42. P. Winter, Generalized Steiner problem in Halin networks, in: Proceedings of the 12th International Symposium on Mathematical Programming, MIT, Cambridge, 1985.
43. P. Winter Generalized Steiner problem in series-parallel networks J. Algorithms 7 1986 549 566