{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:15:49Z","timestamp":1743653749254,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_1","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["Space Lower Bounds for Low-Stretch Greedy Embeddings"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kalaitzis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","first-page":"287","volume-title":"Handbook of Combinatorics","author":"N. Alon","year":"1996","unstructured":"Alon, N.: Tools from higher algebra. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol.\u00a02, pp. 287\u2013324. MIT Press, Cambridge (1996)"},{"issue":"4","key":"1_CR2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/1383369.1383377","volume":"4","author":"N. Alon","year":"2008","unstructured":"Alon, N., Badoiu, M., Demaine, E.D., Farach-Colton, M., Hajiaghayi, M., Sidiropoulos, A.: Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. ACM Transactions on Algorithms\u00a04(4), art. 46 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Frankl, P., R\u00f6dl, V.: Geometrical realization of set systems and probabilistic communication complexity. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS), pp. 277\u2013280 (1985)","DOI":"10.1109\/SFCS.1985.30"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503\u2013513 (1990)","DOI":"10.1109\/FSCS.1990.89571"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1038\/ncomms1063","volume":"1","author":"M. Boguna","year":"2010","unstructured":"Boguna, M., Papadopoulos, F., Krioukov, D.: Sustaining the internet with hyperbolic mapping. Nature Communications\u00a01, art. 62 (2010)","journal-title":"Nature Communications"},{"issue":"11","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1109\/TC.2010.257","volume":"60","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Goodrich, M.T.: Succinct greedy geometric routing using hyperbolic geometry. IEEE Transactions on Computers\u00a060(11), 1571\u20131580 (2011)","journal-title":"IEEE Transactions on Computers"},{"key":"1_CR7","first-page":"251","volume":"12","author":"P. Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s, P., Sachs, H.: Regul\u00e4re Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe\u00a012, 251\u2013257 (1963)","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Flury, R., Pemmaraju, S.V., Wattenhofer, R.: Greedy routing with bounded stretch. In: Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM), pp. 1737\u20131745 (2009)","DOI":"10.1109\/INFCOM.2009.5062093"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/S0022-0000(02)00019-3","volume":"65","author":"J. Forster","year":"2002","unstructured":"Forster, J.: A linear lower bound on the unbounded error probabilistic communication complexity. Journal of Computer and System Sciences\u00a065(4), 612\u2013625 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM), pp. 1902\u20131909 (2007)","DOI":"10.1109\/INFCOM.2007.221"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica\u00a015(2), 215\u2013245 (1995)","journal-title":"Combinatorica"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics. Springer (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"1_CR13","unstructured":"Maymounkov, P.: Greedy embeddings, trees, and Euclidean vs. Lobachevsky geometry (2006) (manuscript)"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"A. Moitra","year":"2010","unstructured":"Moitra, A., Leighton, T.: Some results on greedy embeddings in metric spaces. Discrete & Computational Geometry\u00a044(3), 686\u2013705 (2010)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"341","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoretical Computer Science\u00a0341(1), 3\u201314 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"1_CR16","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. Journal of the ACM\u00a036(3), 510\u2013530 (1989)","journal-title":"Journal of the ACM"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","volume":"138","author":"H.E. Warren","year":"1968","unstructured":"Warren, H.E.: Lower bounds for approximation by nonlinear manifolds. Transactions of the American Mathematical Society\u00a0138(1), 167\u2013178 (1968)","journal-title":"Transactions of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T14:49:14Z","timestamp":1743605354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}