{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:25:54Z","timestamp":1726410354580},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_5","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"52-63","source":"Crossref","is-referenced-by-count":0,"title":["Distance Labels with Optimal Local Stretch"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[]},{"given":"Shiri","family":"Chechik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/1250790.1250883","volume-title":"Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC 2007","author":"I. Abraham","year":"2007","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Local embeddings of metric spaces. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC 2007, pp. 631\u2013640. ACM, New York (2007)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: On low dimensional local embeddings. In: SODA 2009: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 875\u2013884. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611973068.95"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H. Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science\u00a0316, 566 (2007)","journal-title":"Science"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Chechik, S.: Approximate distance oracles with constant query time (2014) (to appear in STOC 2014)","DOI":"10.1145\/2591796.2591801"},{"issue":"2","key":"5_CR5","first-page":"609","volume":"10","author":"P. Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Infinite and Finite Sets\u00a010(2), 609\u2013627 (1975)","journal-title":"Infinite and Finite Sets"},{"key":"5_CR6","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory. In: Theory of Graphs and Its Applications, Proc. Sympos. Smolenice, pp. 29\u201336 (1964)"},{"key":"5_CR7","first-page":"109","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Mendel","year":"2006","unstructured":"Mendel, M., Naor, A.: Ramsey partitions and proximity data structures. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 109\u2013118. IEEE Computer Society, Washington, DC (2006)"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.4171\/JEMS\/79","volume":"9","author":"M. Mendel","year":"2007","unstructured":"Mendel, M., Naor, A.: Ramsey partitions and proximity data structures. Journal of the European Mathematical Society\u00a09(2), 253\u2013275 (2007)","journal-title":"Journal of the European Mathematical Society"},{"issue":"1","key":"5_CR9","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), 1\u201324 (2005)","journal-title":"J. ACM"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Wulff-Nilsen, C.: Approximate distance oracles with improved query time. In: Proceedings of the Twenty-Forth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. SIAM (2013)","DOI":"10.1137\/1.9781611973105.39"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:17:18Z","timestamp":1558909038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}