{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:25:05Z","timestamp":1747578305300,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662518"},{"type":"electronic","value":"9783540484813"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48481-7_10","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T23:49:40Z","timestamp":1193528980000},"page":"101-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for Restoration Capacity Planning"],"prefix":"10.1007","author":[{"given":"Steven J.","family":"Phillips","sequence":"first","affiliation":[]},{"given":"Jeffery R.","family":"Westbrook","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"10_CR1","unstructured":"D. Alevras, M. Gr\u00f6tschel, and R. Wess\u00e4ly. Capacity and survivability models for telecommunication networks. Technical Report ZIB Preprint SC 97-24, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, 1997. http:\/\/www.zib.de\/pub\/zib-publications\/reports\/SC-97-24.ps ."},{"key":"10_CR2","unstructured":"G. Brightwell, G. Oriolo, and F. B. Shepherd. Some strategies for reserving resilient capacity. Technical Report LSE-CDAM-98-04, London School of Economics Centre for Discrete and Applicable Mathematics, 1998. http:\/\/www.cdam.lse.ac.uk\/Reports\/Files\/cdam-98-04.ps.gz ."},{"key":"10_CR3","unstructured":"S. Cwilich, M. Deng, D. Houck, and D. Lynch. An LP-based approach to restoration network design. In ITC16, International Teletraffic Congress, 1999."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"S. Cwilich, M. Deng, D. Lynch, S. Phillips, and J. Westbrook. Algorithms for restoration planning in a telecommunications network. In Proc.ACMWorkshop on Experimental Analysis of Algorithms (ALENEX 99). Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48518-X_12"},{"issue":"4","key":"10_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":"10_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."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C. L. Monma, and M. Stoer. Design of survivable networks. In Handbooks in Operations Research and Management Science, Network Models, chapter 10, pages 617\u2013672. North-Holland, 1995.","DOI":"10.1016\/S0927-0507(05)80127-6"},{"issue":"6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1109\/90.477723","volume":"3","author":"M. Herzberg","year":"1995","unstructured":"M. Herzberg, S. J. Bye, and A. Utano. The hop-limit approach for spare-capacity assignment in survivable networks. IEEE\/ACM Trans. on Networking, 3(6):775\u2013783, 1995.","journal-title":"IEEE\/ACM Trans. on Networking"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/90.700896","volume":"6","author":"R. R. Iraschko","year":"1998","unstructured":"R. R. Iraschko, M. H. MacGregor, and W. D. Grover. Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks. IEEE\/ACM Trans. on Networking, 6(3):325\u2013336, 1998.","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"K. Jain. A factor 2 approximation algorithm for the generalized network steiner problem. In Proc. 39th IEEE Symp. on Foundation of Computer Science, pages 448\u2013457, 1998.","DOI":"10.1109\/SFCS.1998.743495"},{"key":"10_CR11","unstructured":"J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD Thesis, Department of EECS, MIT, 1996."},{"key":"10_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"P. Raghavan and C. Thompson. Randomized rounding. Combinatorica, 7:365\u2013374, 1987.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA\u2019 99"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48481-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:44:06Z","timestamp":1737503046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48481-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662518","9783540484813"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48481-7_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}