{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:20:39Z","timestamp":1725603639795},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_51","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"603-614","source":"Crossref","is-referenced-by-count":5,"title":["Preprocess, Set, Query!"],"prefix":"10.1007","author":[{"given":"Ely","family":"Porat","sequence":"first","affiliation":[]},{"given":"Liam","family":"Roditty","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gottlieb, L., Kopelowitz, T., Lewenstein, M., Roditty, L.: Fast, precise and dynamic distance queries. In: Proc. of 22th SODA (to appear, 2011)","DOI":"10.1137\/1.9781611973082.66"},{"issue":"7","key":"51_CR2","doi-asserted-by":"publisher","first-page":"2865","DOI":"10.1137\/080737174","volume":"39","author":"S. Baswana","year":"2010","unstructured":"Baswana, S., Kavitha, T.: Faster algorithms for all-pairs approximate shortest paths in undirected graphs. SIAM J. Comput.\u00a039(7), 2865\u20132896 (2010)","journal-title":"SIAM J. Comput."},{"key":"51_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-04355-0_41","volume-title":"Distributed Computing","author":"W. Chen","year":"2009","unstructured":"Chen, W., Sommer, C., Teng, S.-H., Wang, Y.: Compact routing in power-law graphs. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 379\u2013391. Springer, Heidelberg (2009)"},{"issue":"2","key":"51_CR4","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"},{"issue":"3","key":"51_CR5","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1137\/S0097539701393384","volume":"33","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Peleg, D.: (1+epsilon, beta)-spanner constructions for general graphs. SIAM J. Comput.\u00a033(3), 608\u2013631 (2004)","journal-title":"SIAM J. Comput."},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Enachescu, M., Wang, M., Goel, A.: Reducing maximum stretch in compact routing. In: INFOCOM, pp. 336\u2013340 (2008)","DOI":"10.1109\/INFOCOM.2008.76"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Krioukov, D., Fall, K.R., Yang, X.: Compact routing on internet-like graphs. In: INFOCOM (2004)","DOI":"10.1109\/INFCOM.2004.1354495"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Mendel, M., Naor, A.: Ramsey partitions and proximity data structures. In: Proc. of 47th FOCS, pp. 109\u2013118 (2006)","DOI":"10.1109\/FOCS.2006.65"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M.: (data) structures. In: Proc. of 49th FOCS, pp. 434\u2013443 (2008)","DOI":"10.1109\/FOCS.2008.69"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Roditty, L.: Distance oracles beyond the thorup\u2013zwick bound. In: Proc. of 51st FOCS (2010)","DOI":"10.1109\/FOCS.2010.83"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Peleg, D., Sch\u00e4ffer, A.A.: Graph spanners. J. Graph Theory, 99\u2013116 (1989)","DOI":"10.1002\/jgt.3190130114"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Pettie, S.: Low distortion spanners. ACM Transactions on Algorithms\u00a06(1) (2009)","DOI":"10.1145\/1644015.1644022"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Sommer, C., Verbin, E., Yu, W.: Distance oracles for sparse graphs. In: Proc. of 50th FOCS, pp. 703\u2013712 (2009)","DOI":"10.1109\/FOCS.2009.27"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: Proc. of 17th SODA","DOI":"10.1145\/1109557.1109645"},{"issue":"1","key":"51_CR15","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. JACM\u00a052(1), 1\u201324 (2005)","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:07:46Z","timestamp":1560528466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}