{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:28Z","timestamp":1759638928821,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"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-04355-0_20","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T02:44:15Z","timestamp":1253673855000},"page":"176-190","source":"Crossref","is-referenced-by-count":7,"title":["Local Computation of Nearly Additive Spanners"],"prefix":"10.1007","author":[{"given":"Bilel","family":"Derbel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"23 rd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","author":"P. Jacquet","year":"2009","unstructured":"Jacquet, P., Viennot, L.: Remote spanners: what to know beyond neighbors. In: 23 rd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE Computer Society Press, Los Alamitos (2009)"},{"key":"20_CR2","unstructured":"Adjih, C., Laouiti, A., Muhlethaler, P., Qayyum, A., Viennot, L.: The optimised routing protocol for mobile ad-hoc networks: protocol specification. Technical Report 5145, INRIA (March 2003)"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/41840.41847","volume-title":"6 th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"D. Peleg","year":"1987","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. In: 6 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 77\u201385. ACM Press, New York (1987)"},{"issue":"1","key":"20_CR4","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. Journal of Graph Theory\u00a013(1), 99\u2013116 (1989)","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. Journal of the ACM\u00a032(4), 804\u2013823 (1985)","journal-title":"Journal of the ACM"},{"issue":"4","key":"20_CR6","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 synchornizer for the hypercube. SIAM Journal on Computing\u00a018(4), 740\u2013747 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794261295","volume":"28","author":"E. Cohen","year":"1998","unstructured":"Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing\u00a028(1), 210\u2013236 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00446-005-0147-2","volume":"18","author":"M. Elkin","year":"2006","unstructured":"Elkin, M., Zhang, J.: Efficient algorithms for constructing (1\u2009+\u2009\u03b5,\u03b2)-spanners in the distributed and streaming models. Distributed Computing\u00a018(5), 375\u2013385 (2006)","journal-title":"Distributed Computing"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-540-31856-9_55","volume-title":"STACS 2005","author":"S. Baswana","year":"2005","unstructured":"Baswana, S., Goyal, V., Sen, S.: All-pairs nearly 2-approximate shortest-paths in O(n 2 polylog n) time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 666\u2013679. Springer, Heidelberg (2005)"},{"key":"20_CR10","first-page":"591","volume-title":"47 th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"S. Baswana","year":"2006","unstructured":"Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: 47 th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 591\u2013602. IEEE Computer Society Press, Los Alamitos (2006)"},{"issue":"1","key":"20_CR11","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), 1\u201324 (2005)","journal-title":"Journal of the ACM"},{"key":"20_CR12","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)"},{"key":"20_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/1007352.1007372","volume-title":"36 th Annual ACM Symposium on Theory of Computing (STOC)","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: 36 th Annual ACM Symposium on Theory of Computing (STOC), pp. 81\u201390. ACM Press, New York (2004)"},{"issue":"5","key":"20_CR15","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 Journal on Computing\u00a029(5), 1740\u20131759 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: 17 th Symposium on Discrete Algorithms (SODA), January 2006, pp. 802\u2013809. ACM\/ SIAM (2006)","DOI":"10.1145\/1109557.1109645"},{"issue":"4","key":"20_CR17","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 Journal of Discrete Mathematics\u00a019(4), 1029\u20131055 (2006)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"20_CR18","volume-title":"41 st Annual ACM Symposium on Theory of Computing (STOC)","author":"S. Chechik","year":"2009","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: Fault-tolerant spanners for general graphs. In: 41 st Annual ACM Symposium on Theory of Computing (STOC). ACM Press, New York (2009)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms\u00a03(4), Article 29 (2008)","DOI":"10.1145\/1367064.1367069"},{"key":"20_CR20","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)"},{"issue":"1","key":"20_CR21","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., Joseph, D.A., Soares, J.: On sparse spanners of weighted graphs. Discrete & Computational Geometry\u00a09(1), 81\u2013100 (1993)","journal-title":"Discrete & Computational Geometry"},{"key":"20_CR22","first-page":"29","volume-title":"Extremal problems in graph theory","author":"P. Erd\u00f6s","year":"1964","unstructured":"Erd\u00f6s, P.: Extremal problems in graph theory, pp. 29\u201336. Publ. House Cszechoslovak Acad. Sci., Prague (1964)"},{"issue":"3","key":"20_CR23","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579234","volume":"2","author":"P. Erd\u00f6s","year":"1982","unstructured":"Erd\u00f6s, P., Simonovits, M.: Compactness results in extremal graph theory. Combinatorica\u00a02(3), 275\u2013288 (1982)","journal-title":"Combinatorica"},{"issue":"4","key":"20_CR24","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 Journal on Computing\u00a028(4), 1167\u20131181 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR25","unstructured":"Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: New constructions of (\u03b1,\u03b2)-spanners and purely additive spanners. In: 16 th Symposium on Discrete Algorithms (SODA), pp. 672\u2013681. ACM\/ SIAM (2005)"},{"key":"20_CR26","first-page":"389","volume-title":"47 th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"D.P. Woodruff","year":"2006","unstructured":"Woodruff, D.P.: Lower bounds for additive spanners, emulators, and more. In: 47 th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 389\u2013398. IEEE Computer Society Press, Los Alamitos (2006)"},{"issue":"3","key":"20_CR27","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1137\/S0097539701393384","volume":"33","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Peleg, D.: (1\u2009+\u2009\u03b5,\u03b2)-spanner constructions for general graphs. SIAM Journal on Computing\u00a033(3), 608\u2013631 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR28","first-page":"253","volume-title":"27 th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"S. Pettie","year":"2008","unstructured":"Pettie, S.: Distributed algorithms for ultrasparse spanners and linear size skeletons. In: 27 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 253\u2013262. ACM Press, New York (2008)"},{"key":"20_CR29","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 a (2k\u2009\u2212\u20091)-spanner of O(n 1\u2009+\u20091\/k ) size 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)"},{"key":"20_CR30","first-page":"273","volume-title":"27 th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"B. Derbel","year":"2008","unstructured":"Derbel, B., Gavoille, C., Peleg, D., Viennot, L.: On the locality of distributed sparse spanner construction. In: 27 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 273\u2013282. ACM Press, New York (2008)"},{"issue":"2","key":"20_CR31","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 Transactions on Algorithms\u00a01(2), 283\u2013323 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"20_CR32","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/1011767.1011791","volume-title":"23 rd Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Zhang, J.: Efficient algorithms for constructing (1\u2009+\u2009\u03b5,\u03b2)-spanners in the distributed and streaming models. In: 23 rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 160\u2013168. ACM Press, New York (2004)"},{"key":"20_CR33","first-page":"173","volume-title":"33 rd Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Elkin","year":"2001","unstructured":"Elkin, M., Peleg, D.: (1\u2009+\u2009\u03b5,\u03b2)-spanner constructions for general graphs. In: 33 rd Annual ACM Symposium on Theory of Computing (STOC), pp. 173\u2013182. ACM Press, New York (2001)"},{"key":"20_CR34","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/1011767.1011811","volume-title":"23 rd Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"F. Kuhn","year":"2004","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: 23 rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 300\u2013309. ACM Press, New York (2004)"},{"issue":"1","key":"20_CR35","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(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"20_CR36","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","volume":"33","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Proximity-preserving labeling schemes. Journal of Graph Theory\u00a033(3), 167\u2013176 (2000)","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"20_CR37","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/jagm.1996.0017","volume":"20","author":"A. Panconesi","year":"1996","unstructured":"Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. Journal of Algorithms\u00a020(2), 356\u2013374 (1996)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"20_CR38","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing\u00a015(4), 1036\u20131053 (1986)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:49:29Z","timestamp":1633920569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}