{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:05Z","timestamp":1760202605234},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642051173"},{"type":"electronic","value":"9783642051180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05118-0_3","type":"book-chapter","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T02:32:03Z","timestamp":1257301923000},"page":"35-46","source":"Crossref","is-referenced-by-count":3,"title":["As Good as It Gets: Competitive Fault Tolerance in Network Structures"],"prefix":"10.1007","author":[{"given":"David","family":"Peleg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pp. 547\u2013556 (2001)"},{"key":"3_CR2","unstructured":"Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (2003)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. In: Proc. 21st ACM Symp. on Theory of Computing, pp. 230\u2013240 (1989)","DOI":"10.1145\/73007.73053"},{"key":"3_CR4","unstructured":"Awerbuch, B., Baratz, A., Peleg, D.: Efficient broadcast and light-weight spanners. Unpublished manuscript (1991)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Fast network decomposition. In: Proc. 11th ACM Symp. on Principles of Distributed Computing, pp. 169\u2013177 (1992)","DOI":"10.1145\/135419.135456"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Goldberg, A., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364\u2013369 (1989)","DOI":"10.1109\/SFCS.1989.63504"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kutten, S., Peleg, D.: On buffer-economical store-and-forward deadlock prevention. In: Proc. INFOCOM, pp. 410\u2013414 (1991)","DOI":"10.1109\/INFCOM.1991.147532"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: 31st IEEE Symp. on Foundations of Computer Science, pp. 503\u2013513 (1990)","DOI":"10.1109\/FSCS.1990.89571"},{"issue":"4","key":"3_CR9","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":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Karger, D.: A nearly optimal oracle for avoiding failed vertices and edges. In: Proc. 41st ACM Symp. on Theory of Computing, pp. 101\u2013110 (2009)","DOI":"10.1145\/1536414.1536431"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1137\/S0895480103431046","volume":"19","author":"B. Bollob\u00e1s","year":"2006","unstructured":"Bollob\u00e1s, B., Coppersmith, D., Elkin, M.: Sparse distance preservers and additive spanners. SIAM J. on Discr. Math.\u00a019(4), 1029\u20131055 (2006)","journal-title":"SIAM J. on Discr. Math."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: f-sensitivity distance oracles and routing schemes (June 2009) (manuscript)","DOI":"10.1007\/978-3-642-15775-2_8"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: Fault-tolerant spanners for general graphs. In: Proc. 41st ACM Symp. on Theory of computing, pp. 435\u2013444 (2009)","DOI":"10.1145\/1536414.1536475"},{"key":"3_CR14","unstructured":"Chechik, S., Peleg, D.: Fault resilient network structures (2009) (in preparation)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. In: Proc. 34th IEEE Symp. on Foundations of Computer Science, pp. 648\u2013658 (1993)","DOI":"10.1109\/SFCS.1993.366822"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Twigg, A.: Compact forbidden-set routing. In: Proc. 24th Symp. on Theoretical Aspects of Computer Science, pp. 37\u201348 (2007)","DOI":"10.1007\/978-3-540-70918-3_4"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Zhao, H.: Fault-tolerant geometric spanners. Discrete & Computational Geometry\u00a032 (2003)","DOI":"10.1007\/s00454-004-1121-7"},{"key":"3_CR18","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. Computing\u00a037, 1299\u20131318 (2008)","journal-title":"SIAM J. Computing"},{"issue":"5","key":"3_CR19","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. Computing\u00a029(5), 1740\u20131759 (2000)","journal-title":"SIAM J. Computing"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Duan, R., Pettie, S.: Dual-failure distance and connectivity oracles. In: Proc. 20th ACM-SIAM Symp. on Discrete Algorithms (2009)","DOI":"10.1137\/1.9781611973068.56"},{"key":"3_CR21","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":"3_CR22","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); PODC Jubilee Special Issue","journal-title":"Distributed Computing"},{"issue":"4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., 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":"3_CR24","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"T.C. Hu","year":"1974","unstructured":"Hu, T.C.: Optimum communication spanning trees. SIAM J. Computing\u00a03, 188\u2013195 (1974)","journal-title":"SIAM J. Computing"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: Proc. 20th ACM Symp. on Theory of Computing, May 1988, pp. 334\u2013343 (1988)","DOI":"10.1145\/62212.62244"},{"key":"3_CR26","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning and shortest paths trees. In: Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, Austin, Texas (1993)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Levcopoulos, C., Narasimhan, G., Smid, M.: Efficient algorithms for constructing fault-tolerant geometric spanners. In: Proc. 30th ACM Symp. on Theory of computing, pp. 186\u2013195 (1998)","DOI":"10.1145\/276698.276734"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-48447-7_20","volume-title":"Algorithms and Data Structures","author":"T. Lukovszki","year":"1999","unstructured":"Lukovszki, T.: New results on fault tolerant geometric spanners. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 193\u2013204. Springer, Heidelberg (1999)"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Thorup, M.: Planning for fast connectivity updates. In: Proc. 48th IEEE Symp. on Foundations of Computer Science, pp. 263\u2013271 (2007)","DOI":"10.1109\/FOCS.2007.59"},{"key":"3_CR30","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Peleg, D., Reshef, E.: Deterministic polylog approximation for minimum communication spanning trees. In: Proc. 25th Int. Colloq. on Automata, Languages & Prog., pp. 670\u2013681 (1998)","DOI":"10.1007\/BFb0055092"},{"key":"3_CR32","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 tradeoff between size and efficiency for routing tables. J. ACM\u00a036, 510\u2013530 (1989)","journal-title":"J. ACM"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-46784-X_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Peleg","year":"1999","unstructured":"Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 30\u201341. Springer, Heidelberg (1999)"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/3-540-44612-5_53","volume-title":"Mathematical Foundations of Computer Science 2000","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Informative labeling schemes for graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 579\u2013588. Springer, Heidelberg (2000)"},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4ffer, A.A.: Graph spanners. J. of Graph Theory\u00a013, 99\u2013116 (1989)","journal-title":"J. of Graph Theory"},{"issue":"2","key":"3_CR36","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(2), 740\u2013747 (1989)","journal-title":"SIAM J. Computing"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Proc. 32nd Int. Colloq. on Automata, Languages & Prog., pp. 261\u2013272 (2005)","DOI":"10.1007\/11523468_22"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 14th ACM Symp. on Parallel Algorithms and Architecture, Hersonissos, Crete, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"3_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":"3_CR40","first-page":"802","volume-title":"17th Symp. on Discrete Algorithms (SODA)","author":"M. Thorup","year":"2006","unstructured":"Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: 17th Symp. on Discrete Algorithms (SODA), pp. 802\u2013809. ACM-SIAM, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05118-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:47:50Z","timestamp":1606168070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05118-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642051173","9783642051180"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05118-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}