{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:33:59Z","timestamp":1726407239050},"publisher-location":"Boston, MA","reference-count":67,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387306629"},{"type":"electronic","value":"9780387301655"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-30165-5_15","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T12:26:59Z","timestamp":1228825619000},"page":"367-389","source":"Crossref","is-referenced-by-count":4,"title":["Polyhedral Approaches to the Design of Survivable Networks"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Fortz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martine","family":"Labb\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/moor.25.2.243.12223","volume":"25","author":"M. Ba\u00efou","year":"2000","unstructured":"M. Ba\u00efou, F. Barahona, and A.R Mahjoub. Separation of partition inequalities. Mathematics of Operations Research, 25:243\u2013254, 2000.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"15_CR2","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.4.2.192","volume":"4","author":"A. Balakrishnan","year":"1992","unstructured":"A. Balakrishnan and K. Altinkemer. Using a hop-constrained model to generate alternative communication network design. ORSA Journal on Computing, 4(2): 192\u2013205, 1992.","journal-title":"ORSA Journal on Computing"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02071976","volume":"33","author":"A. Balakrishnan","year":"1991","unstructured":"A. Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong. Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research, 33:239\u2013284, 1991.","journal-title":"Annals of Operations Research"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R.E. Bellman","year":"1958","unstructured":"R.E. Bellman. On a routing problem. Q. Appl. Math., 16:87\u201390, 1958.","journal-title":"Q. Appl. Math."},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1137\/0406047","volume":"6","author":"S.C. Boyd","year":"1993","unstructured":"S.C. Boyd and T. Hao. An integer polytope related to the design of survivable communication networks. SIAM J. Discrete Math., 6(4):612\u2013630, 1993.","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR6","unstructured":"S.C. Boyd and F. Zhang. Transforming clique tree inequalities to induce facets for the 2-edge connected polytope. Technical Report TR-94-13, Department of Computer Science, University of Ottawa, 1994."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/net.3230190112","volume":"19","author":"G.-R. Cai","year":"1989","unstructured":"G.-R. Cai and Y.-G. Sun. The minimum augmentation of any graph to a k-edge-connected graph. Networks, 19:151\u2013172, 1989.","journal-title":"Networks"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S0895480191222665","volume":"7","author":"S. Chopra","year":"1994","unstructured":"S. Chopra. The k-edge-connected spanning subgraph polyhedron. SIAM J. Discrete Math., 7(2):245\u2013259, 1994.","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TCT.1970.1083100","volume":"CT-17","author":"W. Chou","year":"1970","unstructured":"W. Chou and H. Frank. Survivable communication networks and the terminal capacity matrix. IEEE Transactions on Circuit Theory, CT-17:192\u2013197, 1970.","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"15_CR10","unstructured":"N. Christofides and C.A. Whitlock. Network synthesis with connectivity constraints \u2014 a survey. In J.P. Brans, editor, Operational Research\u2019 81, pages 705\u2013723. North-Holland Publishing Company, 1981."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"G. Cornu\u00e9jols, F. Fonlupt, and D. Naddef. The traveling salesman problem on a graph and some related integer polyhedra. Mathematical Programming, 33:1\u201327, 1985.","journal-title":"Mathematical Programming"},{"key":"15_CR12","unstructured":"C.R. Coullard, A. Rais, R.R. Rardin, and D.K. Wagner. The 2-connected-Steiner-subgraph polytope for series-parallel graphs. Technical Report CC-91-32, Purdue University, 1991."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0166-218X(94)00135-Z","volume":"66","author":"C.R. Coullard","year":"1996","unstructured":"C.R. Coullard, A. Rais, R.R. Rardin, and D.K. Wagner. The dominant of the 2-connected-Steiner-subgraph polytope for W 4-free graphs. Discrete Applied Mathematics, 66:195\u2013205, 1996.","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"C.R. Coullard, A. Rais, D.K. Wagner, and R.L. Rardin. Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs. Networks, 23, 1993.","DOI":"10.1002\/net.3230230307"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0167-6377(99)00025-5","volume":"25","author":"G. Dahl","year":"1999","unstructured":"G. Dahl. Notes on polyhedra associated with hop-constrained paths. Operations Research Letters, 25:97\u2013101, 1999.","journal-title":"Operations Research Letters"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0167-6377(03)00026-9","volume":"32","author":"G. Dahl","year":"2004","unstructured":"G. Dahl and L Gouveia. On the directed hop-constrained shortest path problem. Operations Research Letters, 32:15\u201322, 2004.","journal-title":"Operations Research Letters"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/net.20003","volume":"43","author":"G. Dahl","year":"2004","unstructured":"G. Dahl and B. Johannessen. The 2-path network problem. Networks, 43:190\u2013199, 2004.","journal-title":"Networks"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.orl.2003.10.008","volume":"32","author":"G. Dahl","year":"2004","unstructured":"G. Dahl, Foldnes N., and L Gouveia. A note on hop-constrained walk polytopes. Operations Research Letters, 32:345\u2013349, 2004.","journal-title":"Operations Research Letters"},{"key":"15_CR19","unstructured":"A. De Jongh. Uncapacitated network design with bifurcated routing. PhD thesis, Universit\u00e9 Libre de Bruxelles, 1998."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0167-6377(96)00015-6","volume":"19","author":"M. Didi Biha","year":"1996","unstructured":"M. Didi Biha and A.R. Mahjoub. k-edge connected polyhedra on series-parallel graphs. Operations Research Letters, 19:71\u201378, 1996.","journal-title":"Operations Research Letters"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1: 269\u2013271, 1959.","journal-title":"Numer. Math."},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"K.P. Eswaran and R.E. Tarjan. Augmentation problems. SIAM Journal on Computing, 5:653\u2013665, 1976.","journal-title":"SIAM Journal on Computing"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"B. Fortz. Design of Survivable Networks with Bounded Rings, volume 2 of Network Theory and Applications. Kluwer Academic Publishers, 2000.","DOI":"10.1007\/978-1-4615-4669-6"},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10107-002-0299-9","volume":"93","author":"B. Fortz","year":"2002","unstructured":"B. Fortz and M. Labb\u00e9. Polyhedral results for two-connected networks with bounded rings. Mathematical Programming, 93(1):27\u201354, 2002.","journal-title":"Mathematical Programming"},{"issue":"2","key":"15_CR25","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/B:COAP.0000008649.61438.6b","volume":"27","author":"B. Fortz","year":"2004","unstructured":"B. Fortz and M. Labb\u00e9. Two-connected networks with rings of bounded cardinality. Computational Optimization and Applications, 27(2): 123\u2013148, 2004.","journal-title":"Computational Optimization and Applications"},{"issue":"6","key":"15_CR26","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1287\/opre.48.6.866.12390","volume":"48","author":"B. Fortz","year":"2000","unstructured":"B. Fortz, M. Labb\u00e9, and F. Maffioli. Solving the two-connected network with bounded meshes problem. Operations Research, 48(6):866\u2013877, 2000.","journal-title":"Operations Research"},{"key":"15_CR27","unstructured":"B. Fortz, A.R. Mahjoub, S.T. Mc Cormick, and P. Pesneau. Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut. IAG Working Paper 98\/03, Universit\u00e9 Catholique de Louvain, 2003a. To appear in Mathematical Programming."},{"issue":"2","key":"15_CR28","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/S0377-2217(02)00826-3","volume":"151","author":"B. Fortz","year":"2003","unstructured":"B. Fortz, P. Soriano, and C. Wynants. A tabu search algorithm for self-healing ring network design. European Journal of Operational Research, 151(2):280\u2013295, 2003b.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"15_CR29","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM J. on Discrete Mathematics, 5(1):22\u201353, 1992.","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TCT.1970.1083185","volume":"CT-17","author":"H. Frank","year":"1970","unstructured":"H. Frank and W. Chou. Connectivity considerations in the design of survivable networks. IEEE Transactions on Circuit Theory, CT-17:486\u2013490, 1970.","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"15_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/net.3230010108","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"D.R. Fulkerson and L.S. Shapley. Minimal k-arc connected graphs. Networks, 1: 91\u201398, 1971.","journal-title":"Networks"},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0166-218X(92)00035-K","volume":"51","author":"M.X. Goemans","year":"1994","unstructured":"M.X. Goemans. Arborescence polytopes for series-parallel graphs. Discrete Applied Mathematics, 51:277\u2013289, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"R.E. Gomory and T.C. Hu. Multi-terminal network flows. SIAM J. Appl. Math., 9: 551\u2013570, 1961.","journal-title":"SIAM J. Appl. Math."},{"key":"15_CR34","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","volume":"95","author":"L. Gouveia","year":"1996","unstructured":"L. Gouveia. Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research, 95:178\u2013190, 1996.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"15_CR35","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.10069","volume":"41","author":"L. Gouveia","year":"2003","unstructured":"L. Gouveia and T.L. Magnanti. Network flow models for designing diameter-constrained minimum-spanning and steiner trees. Networks, 41(3): 159\u2013173, 2003.","journal-title":"Networks"},{"key":"15_CR36","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"M. Gr\u00f6tschel and C.L. Monma. Integer polyhedra arising from certain design problems with connectivity constraints. SIAM J. Discrete Math., 3:502\u2013523, 1990.","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"15_CR37","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/opre.40.2.309","volume":"40","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"M. Gr\u00f6tschel, C.L. Monma, and M. Stoer. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research, 40(2):309\u2013330, 1992a.","journal-title":"Operations Research"},{"issue":"3","key":"15_CR38","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/0802024","volume":"2","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"M. Gr\u00f6tschel, C.L. Monma, and M. Stoer. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optimization, 2(3):474\u2013504, 1992b.","journal-title":"SIAM J. Optimization"},{"key":"15_CR39","first-page":"617","volume":"7","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"M. Gr\u00f6tschel, C.L. Monma, and M. Stoer. Design of Survivable Networks, volume 7 on Network models of Handbooks in OR\/MS, chapter 10, pages 617\u2013672. North-Holland, 1995a.","journal-title":"Design of Survivable Networks"},{"issue":"6","key":"15_CR40","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1287\/opre.43.6.1012","volume":"43","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"M. Gr\u00f6tschel, C.L. Monma, and M. Stoer. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Operations Research, 43(6): 1012\u20131024, 1995b.","journal-title":"Operations Research"},{"key":"15_CR41","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","volume":"48","author":"F. Harary","year":"1962","unstructured":"F. Harary. The maximum connectivity of a graph. In Proceedings of the National Academy of Sciences, volume 48, pages 1142\u20131146, USA, 1962.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"T.-S. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. In Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 548\u2013559, 1991.","DOI":"10.1109\/SFCS.1991.185418"},{"key":"15_CR43","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/0222056","volume":"22","author":"T.-S. Hsu","year":"1993","unstructured":"T.-S. Hsu and V. Ramachandran. On finding a minimum augmentation to biconnect a graph. SIAM Journal on Computing, 22:889\u2013891, 1993.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"15_CR44","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/S0895480102419445","volume":"18","author":"D. Huygens","year":"2004","unstructured":"D. Huygens, A.R. Mahjoub, and P. Pesneau. Two edge-disjoint hop-constrained paths and polyhedra. SIAM Journal on Discrete Mathematics, 18(2):287\u2013312, 2004.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"15_CR45","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0167-6377(02)00182-7","volume":"30","author":"H. Kerivin","year":"2002","unstructured":"H. Kerivin and A.R. Mahjoub. Separation of the partition inequalities for the (1,2)-survivable network design problem. Operations Research Letters, 30:265\u2013268, 2002.","journal-title":"Operations Research Letters"},{"key":"15_CR46","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"J.B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7:48\u201350, 1956.","journal-title":"Proc. Amer. Math. Soc."},{"key":"15_CR47","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Wilson, New-York, 1976."},{"volume-title":"The Traveling Salesman Problem","year":"1985","key":"15_CR48","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, New-York, 1985."},{"key":"15_CR49","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01582572","volume":"64","author":"A.R. Mahjoub","year":"1994","unstructured":"A.R. Mahjoub. Two-edge connected spanning subgraphs and polyhedra. Mathematical Programming, 64:199\u2013208, 1994.","journal-title":"Mathematical Programming"},{"key":"15_CR50","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"K. Menger. Zur allgemeinen kurventheorie. Fundamenta Mathematicae, 10:96\u2013115, 1927.","journal-title":"Fundamenta Mathematicae"},{"issue":"4","key":"15_CR51","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/opre.37.4.531","volume":"37","author":"C.L. Monma","year":"1989","unstructured":"C.L. Monma and D.F. Shallcross. Methods for designing communications networks with certain two-connected survivability constraints. Operations Research, 37(4): 531\u2013541, 1989.","journal-title":"Operations Research"},{"key":"15_CR52","doi-asserted-by":"crossref","unstructured":"D. Naor, D. Gusfield, and Ch. Martel. A fast algorithm for optimally increasing the edge-connectivity. In Proceedings of the Foundation of Computer Science\u2019 90, pages 698\u2013707, St. Louis, 1990.","DOI":"10.1109\/FSCS.1990.89592"},{"key":"15_CR53","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wolsey. Integer and combinatorial optimization. Wiley-Interscience series in discrete mathematics and optimization. Wiley, 1988.","DOI":"10.1002\/9781118627372"},{"key":"15_CR54","unstructured":"V.-H Nguyen. A complete description for the k-path polyhedron. Technical report, LIP6, 2003."},{"key":"15_CR55","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim. Shortest connection networks and some generalizations. Bell System Tech. J., 36:1389\u20131401, 1957.","journal-title":"Bell System Tech. J."},{"key":"15_CR56","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1137\/0206003","volume":"6","author":"A. Rosenthal","year":"1977","unstructured":"A. Rosenthal and A. Goldner. Smallest augmentation to biconnect a graph. SIAM Journal on Computing, 6:55\u201366, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"15_CR57","doi-asserted-by":"crossref","unstructured":"M. Stoer. Design of Survivable Networks, volume 1531 of Lecture Notes in Mathematics. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0088963"},{"key":"15_CR58","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J.W. Suurballe","year":"1974","unstructured":"J.W. Suurballe. Disjoint paths in a network. Networks, 4:125\u2013145, 1974.","journal-title":"Networks"},{"key":"15_CR59","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J.W. Suurballe","year":"1984","unstructured":"J.W. Suurballe and R.E. Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14:325\u2013336, 1984.","journal-title":"Networks"},{"key":"15_CR60","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230180104","volume":"18","author":"S. Ueno","year":"1988","unstructured":"S. Ueno, Y. Kajitani, and H. Wada. Minimum augmentation of a tree to a k-edge-connected graph. Networks, 18:19\u201325, 1988.","journal-title":"Networks"},{"key":"15_CR61","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J.A. Wald","year":"1983","unstructured":"J.A. Wald and C.J. Colbourn. Steiner trees, partial 2-trees, and minimum ifi networks. Networks, 13:159\u2013167, 1983.","journal-title":"Networks"},{"key":"15_CR62","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"T. Watanabe and A. Nakamura. Edge-connectivity augmentation problems. Computer and System Sciences, 35:96\u2013144, 1987.","journal-title":"Computer and System Sciences"},{"key":"15_CR63","unstructured":"P. Winter. Generalized Steiner problem in halin networks. In Proc. 12th International Symposium on Mathematical Programming. MIT, 1985a."},{"key":"15_CR64","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF01935369","volume":"25","author":"P. Winter","year":"1985","unstructured":"P. Winter. Generalized Steiner problem in outerplanar networks. BIT, 25:485\u2013496, 1985b.","journal-title":"BIT"},{"key":"15_CR65","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0196-6774(86)90018-0","volume":"7","author":"P. Winter","year":"1986","unstructured":"P. Winter. Generalized Steiner problem in series-parallel networks. Journal of Algorithms, 7:549\u2013566, 1986a.","journal-title":"Journal of Algorithms"},{"key":"15_CR66","doi-asserted-by":"crossref","unstructured":"P. Winter. Topological network synthesis. In B. Simeone, editor, Combinatorial Optimization-Como 1986, volume 1403 of Lecture Notes in Mathematics, pages 282\u2013303. Springer-Verlag, 1986b.","DOI":"10.1007\/BFb0083472"},{"key":"15_CR67","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter. Steiner problems in networks: a survey. Networks, 17:129\u2013167, 1987.","journal-title":"Networks"}],"container-title":["Handbook of Optimization in Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30165-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T02:11:45Z","timestamp":1619575905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-30165-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387306629","9780387301655"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30165-5_15","relation":{},"subject":[]}}