{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:24:16Z","timestamp":1755221056659,"version":"3.43.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1023\/a:1019188715963","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"355-378","source":"Crossref","is-referenced-by-count":3,"title":["Heuristic algorithms for the fiber optic network expansion problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Heungsoon Felix","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel R.","family":"Dooly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329658_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0377-2217(84)90314-X","volume":"16","author":"I. Baybars","year":"1984","unstructured":"I. Baybars and K.O. Kortanek, Transmission facility planning in telecommunications networks: A heuristic approach, European J. Oper. Res. 16 (1984) 59\u201383.","journal-title":"European J. Oper. Res."},{"key":"329658_CR2","unstructured":"R.H. Cardwell, H. Fowler, H.L. Lemberg and C.L. Monma, Determining the impact of fiber optic technology on telephone network design, Bellcore Exchange Magazine (1988)."},{"key":"329658_CR3","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Colbourn","year":"1987","unstructured":"C.J. Colbourn, The Combinatorics of Network Reliability (Oxford University Press, New York, 1987)."},{"key":"329658_CR4","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1287\/opre.23.4.810","volume":"23","author":"P.J. Doulliez","year":"1975","unstructured":"P.J. Doulliez and M.R. Rao, Optimal network capacity planning: A shortest path scheme, Oper. Res. 23 (1975) 810\u2013818.","journal-title":"Oper. Res."},{"key":"329658_CR5","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1287\/opre.40.4.689","volume":"40","author":"A. Dutta","year":"1992","unstructured":"A. Dutta and J. Lim, A multiperiod capacity planning model for backbone computer communication networks, Oper. Res. 40 (1992) 689\u2013705.","journal-title":"Oper. Res."},{"key":"329658_CR6","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TCT.1970.1083185","volume":"17","author":"H. Frank","year":"1970","unstructured":"H. Frank and W. Chou, Connectivity considerations in the design of survivable networks, IEEE Trans. Circuit Theory 17 (1970) 486\u2013490.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"329658_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)."},{"issue":"3","key":"329658_CR8","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/0222056","volume":"22","author":"[. T. Hsu","year":"1993","unstructured":"[8] T. Hsu and V. Ramachandran, Finding a smallest augmentation to biconnect a graph, SIAM J. Comput. 22(3) (1993) 889\u2013912.","journal-title":"SIAM J. Comput."},{"key":"329658_CR9","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TR.1986.4335542","volume":"35","author":"S.P. Jain","year":"1986","unstructured":"S.P. Jain and K. Gopal, On network augmentation, IEEE Trans. Reliability 35 (1986) 541\u2013543.","journal-title":"IEEE Trans. Reliability"},{"key":"329658_CR10","series-title":"Technical Report","volume-title":"The maximum-weight connected graph problem","author":"H.F. Lee","year":"1996","unstructured":"H.F. Lee and D.R. Dooly, The maximum-weight connected graph problem, Technical Report 93\u20134, Industrial Engineering, Southern Illinois University, Edwardsville, IL (1996)."},{"key":"329658_CR11","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1002\/(SICI)1520-6750(199610)43:7<985::AID-NAV4>3.0.CO;2-9","volume":"43","author":"H.F. Lee","year":"1996","unstructured":"H.F. Lee and D.R. Dooly, Algorithms for the constrained maximum-weight connected graph problem, Naval Research Logistics 43 (1996) 985\u20131008.","journal-title":"Naval Research Logistics"},{"key":"329658_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"M. Minoux, Network synthesis and optimum network design problems: models, solution methods and applications, Networks 19 (1989) 313\u2013360.","journal-title":"Networks"},{"key":"329658_CR13","doi-asserted-by":"crossref","unstructured":"C.L. Monma and D.F. Shallcross, Methods for designing communications networks with certain two-connected survivability constraints, Oper. Res. 37(4) 531\u2013541.","DOI":"10.1287\/opre.37.4.531"},{"key":"329658_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.3230090105","volume":"9","author":"R.L. Smith","year":"1979","unstructured":"R.L. Smith, Deferral strategies for a dynamic communications network, Networks 9 (1979) 61\u201387.","journal-title":"Networks"},{"key":"329658_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1109\/ISCAS.1989.100359","volume-title":"Proc. 1989 IEEE Internat. Sympos. Circuits and Systems","author":"T. Watanabe","year":"1989","unstructured":"T. Watanabe, T. Narita and A. Nakamura, 3\u2013edge-connectivity augmentation problems, in: Proc. 1989 IEEE Internat. Sympos. Circuits and Systems (IEEE, New York, 1989) pp. 335\u2013338."},{"key":"329658_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/net.3230030302","volume":"1","author":"B. Yaged","year":"1973","unstructured":"B. Yaged, Minimum cost routing for dynamic network models, Networks 1 (1973) 193\u2013224.","journal-title":"Networks"},{"key":"329658_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230040104","volume":"4","author":"N. Zadeh","year":"1974","unstructured":"N. Zadeh, On building minimum cost communication network over time, Networks 4 (1974) 19\u201334.","journal-title":"Networks"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019188715963.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019188715963\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019188715963.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:24:49Z","timestamp":1754634289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019188715963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["329658"],"URL":"https:\/\/doi.org\/10.1023\/a:1019188715963","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}