{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T15:10:32Z","timestamp":1740064232994,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130663"},{"type":"electronic","value":"9783642130670"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13067-0_25","type":"book-chapter","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T21:44:02Z","timestamp":1273009442000},"page":"214-223","source":"Crossref","is-referenced-by-count":0,"title":["A Lower Bound on Greedy Embedding in Euclidean Plane"],"prefix":"10.1007","author":[{"given":"Lei","family":"Cao","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Strelzoff","sequence":"additional","affiliation":[]},{"given":"Jonathan Z.","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Basagni, S., Chlamtac, I., Syrotiuk, V., Woodward, B.: A distance routing effect algorithm for mobility (dream). In: MobiCom 1998: Proceedings of the 4th ACM\/IEEE int. conf. on Mobile computing and networking, pp. 76\u201384 (1998)","key":"25_CR1","DOI":"10.1145\/288235.288254"},{"doi-asserted-by":"crossref","unstructured":"Cao, L., Strelzoff, A., Sun, J.Z.: On succinctness of geometric greedy routing in euclidean plane. In: Proc. The 10th International Symposium on Pervasive Systems, Algorithms and Networks (December 2009)","key":"25_CR2","DOI":"10.1109\/I-SPAN.2009.20"},{"unstructured":"Chen, M.B., Gotsman, C., Gortler, S.J.: Routing with guaranteed delivery on virtual coordinate. In: Proc. Canadian Conf. on Comp. Geom. (2006)","key":"25_CR3"},{"doi-asserted-by":"crossref","unstructured":"Chen, M.B., Gotsman, C., Wormser, C.: Distributed computation of virtual coordinates. In: SCG 2007: Proceedings of the twenty-third annual symposium on Computational geometry, pp. 210\u2013219 (2007)","key":"25_CR4","DOI":"10.1145\/1247069.1247108"},{"unstructured":"Dhandapani, R.: Greedy drawings of triangulations. In: SODA 2008: Proceedings of the 9th annual ACM-SIAM symposium on Discrete algorithms, pp. 102\u2013111 (2008)","key":"25_CR5"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0012-365X(95)00276-3","volume":"161","author":"M.B. Dillencourt","year":"1996","unstructured":"Dillencourt, M.B., Smith, W.D.: Graph-theoretical conditions for inscribability and delaunay realizability. Discrete Mathematics\u00a0161, 63\u201377 (1996)","journal-title":"Discrete Mathematics"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-00219-9_3","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D., Goodrich, M.T.: Succinct greedy graph drawing in the hyperbolic plane. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 14\u201325. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Frey, H., Stojmenovic, I.: On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In: MobiCom 2006: Proceedings of the 12th annual international conference on Mobile computing and networking, pp. 390\u2013401 (2006)","key":"25_CR8","DOI":"10.1145\/1161089.1161133"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_79","volume-title":"Algorithms and Computation","author":"M.T. Goodrich","year":"2009","unstructured":"Goodrich, M.T., Strash, D.: Succinct greedy geometric routing in the euclidean plane. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Kleinberg, R.: Geographic routing using hyperbolic space. In: INFOCOM 2007: 26th IEEE International Conference on Computer Communications, pp. 1902\u20131909 (2007)","key":"25_CR10","DOI":"10.1109\/INFCOM.2007.221"},{"doi-asserted-by":"crossref","unstructured":"Ko, Y.B., Vaidya, N.: Geocasting in mobile ad hoc networks: Location-based multicast algorithms. In: Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), pp. 101\u2013110 (1999)","key":"25_CR11","DOI":"10.1109\/MCSA.1999.749282"},{"unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11 th Canadian Conference on Computational Geometry, pp. 51\u201354 (1999)","key":"25_CR12"},{"doi-asserted-by":"crossref","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: FOCS 2008: 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 337\u2013346 (2008)","key":"25_CR13","DOI":"10.1109\/FOCS.2008.18"},{"unstructured":"Lin, X., Stojmenovic, I.: Geographic distance routing in ad hoc wireless networks. Tech. rep., University of Ottawa (December 1998)","key":"25_CR14"},{"unstructured":"Maymounkov, P.: Greedy embeddings, trees, and euclidean vs. lobachevsky geometry. Tech. rep., M.I.T (2006) (manuscript), http:\/\/pdos.csail.mit.edu\/petar\/papers\/maymounkov-greedy-prelim.pdf","key":"25_CR15"},{"doi-asserted-by":"crossref","unstructured":"Muhammad, R.: A distributed geometric routing algorithm for ad hoc wireless networks. In: Proceedings of the International Conference on Information Technology (ITNG 2007), pp. 961\u2013963 (2007)","key":"25_CR16","DOI":"10.4304\/jnw.2.6.50-57"},{"doi-asserted-by":"crossref","unstructured":"Navas, J.C., Imielinski, T.: Geocast \u2013 geographic addressing and routing. In: MobiCom 1997: Proceedings of the 3rd annual ACM\/IEEE international conference on Mobile computing and networking, pp. 66\u201376 (1997)","key":"25_CR17","DOI":"10.1145\/262116.262132"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci.\u00a0344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Advances in Grid and Pervasive Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13067-0_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T14:53:07Z","timestamp":1740063187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13067-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130663","9783642130670"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13067-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}