{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:25Z","timestamp":1759638985769},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_25","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"277-288","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic vs. Oblivious Routing in Network Design"],"prefix":"10.1007","author":[{"given":"Navin","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Olver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. Bruce","family":"Shepherd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: Proc. of IEEE FOCS, pp. 781\u2013790 (2008)","DOI":"10.1109\/FOCS.2008.62"},{"issue":"1-2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0304-3975(99)00025-0","volume":"221","author":"Y. Bartal","year":"1999","unstructured":"Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theor. Comput. Sci.\u00a0221(1-2), 19\u201339 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"25_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/777313.777314","volume":"46","author":"W. Ben-Ameur","year":"2003","unstructured":"Ben-Ameur, W., Kerivin, H.: New economical virtual private networks. Commun. ACM\u00a046(6), 69\u201373 (2003)","journal-title":"Commun. ACM"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/1324215.1324236","volume":"38","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C.: Routing and network design with robustness to changing or uncertain traffic demands. SIGACT News\u00a038(3), 106\u2013128 (2007)","journal-title":"SIGACT News"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.20165","volume":"50","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C., Oriolo, G., Scutella, M.G., Shepherd, F.B.: Hardness of robust network design. Networks\u00a050(1), 50\u201354 (2007)","journal-title":"Networks"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J. Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci.\u00a069(3), 485\u2013497 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/jagm.1997.0866","volume":"24","author":"A.J. Fingerhut","year":"1997","unstructured":"Fingerhut, A.J., Suri, S., Turner, J.S.: Designing least-cost nonblocking broadband networks. J. Algorithms\u00a024(2), 287\u2013309 (1997)","journal-title":"J. Algorithms"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: Proc. of ACM STOC, pp. 389\u2013398 (2001)","DOI":"10.1145\/380752.380830"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1236457.1236458","volume":"54","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Kumar, A., P\u00e1l, M., Roughgarden, T.: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM\u00a054(3), 11 (2007)","journal-title":"J. ACM"},{"issue":"4","key":"25_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/1290672.1290688","volume":"3","author":"M. Hajiaghayi","year":"2007","unstructured":"Hajiaghayi, M., Kleinberg, R., R\u00e4cke, H., Leighton, T.: Oblivious routing on node-capacitated and directed graphs. ACM Trans. Algorithms\u00a03(4), 51 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"25_CR11","unstructured":"Maggs, B.M., Meyer aud der Heide, F., Westerman, M.: Exploiting locality for networks of limited bandwidth. In: Proc. of IEEE FOCS, pp. 284\u2013293 (1997)"},{"key":"25_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Dicrete Geometry","author":"J. Matousek","year":"2002","unstructured":"Matousek, J.: Lectures on Dicrete Geometry. Springer, Heidelberg (2002)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Olver, N., Shepherd, F.: Approximability of robust network design. (manuscript) (2009)","DOI":"10.1137\/1.9781611973075.89"},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C. Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica\u00a040(4), 245\u2013269 (2004)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:16Z","timestamp":1558524136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}