{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:03:11Z","timestamp":1756425791414,"version":"3.44.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662273"},{"type":"electronic","value":"9783540485186"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48518-x_12","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T13:57:15Z","timestamp":1195048635000},"page":"199-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for Restoration Planning in a Telecommunications Network"],"prefix":"10.1007","author":[{"given":"S.","family":"Cwilich","sequence":"first","affiliation":[]},{"given":"M.","family":"Deng","sequence":"additional","affiliation":[]},{"given":"D. F.","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"S. J.","family":"Phillipsy","sequence":"additional","affiliation":[]},{"given":"J. R.","family":"Westbrooky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"12_CR1","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal. Linear Programming. W. H. Freeman and Company, New York, 1983."},{"key":"12_CR2","unstructured":"S. Cwilich, M. Deng, D. Houck, and D. Lynch. Applications and extensions in restoration network design. Technical report, AT&T Labs, 1999."},{"key":"12_CR3","unstructured":"S. Cwilich, M. Deng, D. Houck, and D. Lynch. An lp-based approach to restoration network design. In Submitted to ITC16, International Teletraffic Congress, 1999."},{"key":"12_CR4","unstructured":"B. Doverspike, S. Phillips, and J. Westbrook. Comparison of transport network architectures. In Submitted to ITC16, International Teletraffic Congress, 1999."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K. Eswaran","year":"1976","unstructured":"K. Eswaran and R. Tarjan. Augmentation problems. SIAM Journal on Computing, 5(4):653\u2013665, 1976.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM J. DISC. MATH., 5(1):25\u201353, 1992.","journal-title":"SIAM J. DISC. MATH."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596\u2013615, 1987.","journal-title":"J. ACM"},{"key":"12_CR8","unstructured":"J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD Thesis, Department of EECS, MIT, 1996."},{"key":"12_CR9","unstructured":"S. Phillips and J. Westbrook. A network capacity and restoration planning toolkit. Technical Report HA6171000-980910-04TM, AT&T Labs, 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experimentation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48518-X_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T07:51:17Z","timestamp":1756367477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48518-X_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662273","9783540485186"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48518-x_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"19 April 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}