{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:01Z","timestamp":1725563701572},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_8","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"84-96","source":"Crossref","is-referenced-by-count":9,"title":["f-Sensitivity Distance Oracles and Routing Schemes"],"prefix":"10.1007","author":[{"given":"Shiri","family":"Chechik","sequence":"first","affiliation":[]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]},{"given":"Liam","family":"Roditty","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1137\/S0097539796303421","volume":"28","author":"D. Aingworth","year":"1999","unstructured":"Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput.\u00a028(4), 1167\u20131181 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. J. Algorithms, 307\u2013341 (1990)","DOI":"10.1016\/0196-6774(90)90017-9"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kutten, S., Peleg, D.: On buffer-economical store-and-forward deadlock prevention. In: INFOCOM, pp. 410\u2013414 (1991)","DOI":"10.1109\/INFCOM.1991.147532"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: 31st FOCS, pp. 503\u2013513 (1990)","DOI":"10.1109\/FSCS.1990.89571"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: FOCS, pp. 591\u2013602 (2006)","DOI":"10.1109\/FOCS.2006.29"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-45061-0_32","volume-title":"Automata, Languages and Programming","author":"S. Baswana","year":"2003","unstructured":"Baswana, S., Sen, S.: A simple linear time algorithm for computing sparse spanners in weighted graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 384\u2013396. Springer, Heidelberg (2003)"},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1198513.1198518","volume":"2","author":"S. Baswana","year":"2006","unstructured":"Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected O(n 2) time. ACM Trans. Algorithms\u00a02(4), 557\u2013577 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR8","unstructured":"Bernstein, A., Karger, D.: Improved distance sensitivity oracles via random sampling. In: 19th SODA, pp. 34\u201343 (2008)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Karger, D.: A nearly optimal oracle for avoiding failed vertices and edges. In: 41st STOC, pp. 101\u2013110 (2009)","DOI":"10.1145\/1536414.1536431"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: Fault-tolerant spanners for general graphs. In: 41st STOC, pp. 435\u2013444 (2009)","DOI":"10.1145\/1536414.1536475"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. In: FOCS, pp. 648\u2013658 (1993)","DOI":"10.1109\/SFCS.1993.366822"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Twigg, A.: Compact forbidden-set routing. In: STACS, pp. 37\u201348 (2007)","DOI":"10.1007\/978-3-540-70918-3_4"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"L.J. Cowen","year":"2001","unstructured":"Cowen, L.J.: Compact routing with minimum stretch. J. Alg.\u00a038, 170\u2013183 (2001)","journal-title":"J. Alg."},{"key":"8_CR14","unstructured":"Demetrescu, C., Italiano, G.F.: Experimental analysis of dynamic all pairs shortest path algorithms. In: 15th SODA 2004, pp. 362\u2013371 (2004)"},{"issue":"5","key":"8_CR15","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1137\/S0097539705429847","volume":"37","author":"C. Demetrescu","year":"2008","unstructured":"Demetrescu, C., Thorup, M., Chowdhury, R., Ramachandran, V.: Oracles for distances avoiding a failed node or link. SIAM J. Comput.\u00a037(5), 1299\u20131318 (2008)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/S0097539797327908","volume":"29","author":"D. Dor","year":"2000","unstructured":"Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM J. Comput.\u00a029(5), 1740\u20131759 (2000)","journal-title":"SIAM J. Comput."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Duan, R., Pettie, S.: Dual-failure distance and connectivity oracles. In: SODA (2009)","DOI":"10.1137\/1.9781611973068.56"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0196-6774(03)00002-6","volume":"46","author":"T. Eilam","year":"2003","unstructured":"Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. J. Algorithms\u00a046, 97\u2013114 (2003)","journal-title":"J. Algorithms"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1145\/1103963.1103968","volume":"1","author":"M. Elkin","year":"2005","unstructured":"Elkin, M.: Computing almost shortest paths. ACM Trans. Alg.\u00a01, 283\u2013323 (2005)","journal-title":"ACM Trans. Alg."},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, N.: Sparsification \u2013 A technique for speeding up dynamic graph algorithms. J. ACM\u00a044 (1997)","DOI":"10.1145\/265910.265914"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Memory requirement for universal routing schemes. In: 14th PODC, pp. 223\u2013230 (1995)","DOI":"10.1145\/224964.224989"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","volume":"61","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C., Gengler, M.: Space-efficiency for routing schemes of stretch factor three. J. Parallel Distrib. Comput.\u00a061, 679\u2013687 (2001)","journal-title":"J. Parallel Distrib. Comput."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","volume":"16","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Distributed Computing\u00a016, 111\u2013120 (2003)","journal-title":"Distributed Computing"},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM\u00a048(4), 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-77050-3_27","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"T. Kavitha","year":"2007","unstructured":"Kavitha, T.: Faster algorithms for all-pairs small stretch distances in weighted graphs. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 328\u2013339. Springer, Heidelberg (2007)"},{"key":"8_CR26","unstructured":"Khanna, N., Baswana, S.: Approximate shortest paths oracle handling single vertex failure. In: STACS (2010)"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica\u00a07, 583\u2013596 (1992)","journal-title":"Algorithmica"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Thorup, M.: Planning for fast connectivity updates. In: 48th FOCS, pp. 263\u2013271 (2007)","DOI":"10.1109\/FOCS.2007.59"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. In: SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"issue":"4","key":"8_CR30","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Computing\u00a018(4), 740\u2013747 (1989)","journal-title":"SIAM J. Computing"},{"issue":"3","key":"8_CR31","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM\u00a036(3), 510\u2013530 (1989)","journal-title":"J. ACM"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/11523468_22","volume-title":"Automata, Languages and Programming","author":"L. Roditty","year":"2005","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 261\u2013272. Springer, Heidelberg (2005)"},{"issue":"3","key":"8_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1367064.1367069","volume":"4","author":"L. Roditty","year":"2008","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms\u00a04(3), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: 36th STOC, pp. 184\u2013191 (2004)","DOI":"10.1145\/1007352.1007387"},{"key":"8_CR35","unstructured":"Thurimella, R.: Techniques for the design of parallel graph algorithms. Ph.D. Thesis. Univ. Texas, Austin (1989)"},{"key":"8_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-27810-8_33","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 384\u2013396. Springer, Heidelberg (2004)"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Worst-case update times for fully-dynamic all-pairs shortest paths. In: 37th STOC, pp. 112\u2013119 (2005)","DOI":"10.1145\/1060590.1060607"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"8_CR39","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. J. ACM\u00a052, 1\u201324 (2005)","journal-title":"J. ACM"},{"key":"8_CR40","unstructured":"Twigg, A.: Compact forbidden-set routing. Ph.D. Thesis. Univ. Cambridge (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:17:50Z","timestamp":1559506670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}