{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:21:22Z","timestamp":1742934082476,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258725"},{"type":"electronic","value":"9783642258732"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_11","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T10:16:34Z","timestamp":1323339394000},"page":"143-158","source":"Crossref","is-referenced-by-count":2,"title":["Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quentin","family":"Godfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s003730200002","volume":"18","author":"N. Alon","year":"2002","unstructured":"Alon, N., Hoory, S., Linial, N.: The Moore bound for irregular graphs. Graphs and Combinatorics\u00a018, 53\u201357 (2002)","journal-title":"Graphs and Combinatorics"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D.P., Joseph, D.A., Soares, J.: On sparse spanners of weighted graphs. Discr. & Comp. Geometry\u00a09, 81\u2013100 (1993)","journal-title":"Discr. & Comp. Geometry"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: 29th ACM Symp. PODC, pp. 410\u2013419 (2010)","DOI":"10.1145\/1835698.1835797"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-540-70575-8_50","volume-title":"Automata, Languages and Programming","author":"S. Baswana","year":"2008","unstructured":"Baswana, S., Gaur, A., Sen, S., Upadhyay, J.: Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 609\u2013621. Springer, Heidelberg (2008)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: 47th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pp. 591\u2013602. IEEE Comp. Soc. Press (October 2006)","DOI":"10.1109\/FOCS.2006.29"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"3403","DOI":"10.1137\/090758039","volume":"39","author":"S. Chechik","year":"2010","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: Fault tolerant spanners for general graphs. SIAM Journal on Computing\u00a039, 3403\u20133423 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Cowen, L.J., Wagner, C.: Compact roundtrip routing in directed networks. In: 19th ACM Symp. PODC, pp. 51\u201359 (2000)","DOI":"10.1145\/343477.343516"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Derbel, B., Gavoille, C., Peleg, D., Viennot, L.: On the locality of distributed sparse spanner construction. In: 27th ACM Symp. PODC, p. 273 (2008)","DOI":"10.1145\/1400751.1400788"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Krauthgamer, R.: Fault-tolerant spanners: Better and simpler, Tech. Rep. 1101.5753v1 [cs.DS], arXiv (January 2011)","DOI":"10.1145\/1993806.1993830"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-13284-1_17","volume-title":"Structural Information and Communication Complexity","author":"C. Gavoille","year":"2010","unstructured":"Gavoille, C., Godfroy, Q., Viennot, L.: Multipath Spanners. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 211\u2013223. Springer, Heidelberg (2010)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Godfroy, Q., Viennot, L.: Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners, HAL-00622915 (September 2011)","DOI":"10.1007\/978-3-642-25873-2_11"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Sommer, C.: Sparse spanners vs. compact routing. In: 23rd ACM Symp. SPAA, pp. 225\u2013234 (June 2011)","DOI":"10.1145\/1989493.1989526"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Jacquet, P., Viennot, L.: Remote spanners: what to know beyond neighbors. In: 23rd IEEE International Parallel & Distributed Processing Symp. (IPDPS). IEEE Computer Society Press (May 2009)","DOI":"10.1109\/IPDPS.2009.5161041"},{"key":"11_CR14","unstructured":"Kushman, N., Kandula, S., Katabi, D., Maggs, B.M.: R-bgp: Staying connected in a connected world. In: 4th Symp. on NSDI (2007)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graphs algorithms. SIAM Journal on Computing\u00a021, 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02019432","volume":"9","author":"L. Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L., Neumann-Lara, V., Plummer, M.D.: Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica\u00a09, 269\u2013276 (1978)","journal-title":"Periodica Mathematica Hungarica"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-24663-3_10","volume-title":"Performance Tools and Applications to Networked Systems","author":"S. Mueller","year":"2004","unstructured":"Mueller, S., Tsang, R.P., Ghosal, D.: Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges. In: Calzarossa, M.C., Gelenbe, E. (eds.) MASCOTS 2003. LNCS, vol.\u00a02965, pp. 209\u2013234. Springer, Heidelberg (2004)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1023\/A:1011426611520","volume":"6","author":"A. Nasipuri","year":"2001","unstructured":"Nasipuri, A., Casta\u00f1eda, R., Das, S.R.: Performance of multipath routing for on-demand protocols in mobile ad hoc networks. Mobile Networks and Applications\u00a06, 339\u2013349 (2001)","journal-title":"Mobile Networks and Applications"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Pan, P., Swallow, G., Atlas, A.: Fast Reroute Extensions to RSVP-TE for LSP Tunnels. RFC 4090 (Proposed Standard) (2005)","DOI":"10.17487\/rfc4090"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-73420-8_9","volume-title":"Automata, Languages and Programming","author":"S. Pettie","year":"2007","unstructured":"Pettie, S.: Low Distortion Spanners. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 78\u201389. Springer, Heidelberg (2007)"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(93)90573-C","volume":"120","author":"L. Pyber","year":"1993","unstructured":"Pyber, L., Tuza, Z.: Menger-type theorems with restrictions on path lengths. Discrete Mathematics\u00a0120, 161\u2013174 (1993)","journal-title":"Discrete Mathematics"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms\u00a03, Article 29 (2008)","DOI":"10.1145\/1367064.1367069"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J.W. Suurballe","year":"1984","unstructured":"Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks\u00a014, 325\u2013336 (1984)","journal-title":"Networks"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. Journal of the ACM\u00a052, 1\u201324 (2005)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:27:52Z","timestamp":1558297672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}