{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T22:10:23Z","timestamp":1741212623814,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"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-21204-8_10","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"58-69","source":"Crossref","is-referenced-by-count":2,"title":["Greedy Routing via Embedding Graphs onto Semi-metric Spaces"],"prefix":"10.1007","author":[{"given":"Huaming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swetha","family":"Govindaiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-11805-0_17","volume-title":"Graph Drawing","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Di Battista, G., Frati, F.: Succinct greedy drawings do not always exist. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 171\u2013182. Springer, Heidelberg (2010)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-00219-9_4","volume-title":"Graph Drawing","author":"P. Angelini","year":"2009","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 26\u201337. Springer, Heidelberg (2009)"},{"key":"10_CR3","first-page":"731","volume":"18","author":"D. Barnette","year":"1966","unstructured":"Barnette, D.: 3-trees in polyhedral graphs. Isreal Journal of Mathematics\u00a018, 731\u2013736 (1966)","journal-title":"Isreal Journal of Mathematics"},{"key":"10_CR4","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Elsevier Science Publishing Co., Inc., Amsterdam"},{"key":"10_CR5","volume-title":"Internetworking with TCP\/IP, Volume 1: Principles, Protocols, and Architecture","author":"D. Comer","year":"2006","unstructured":"Comer, D.: Internetworking with TCP\/IP, Volume 1: Principles, Protocols, and Architecture. Prentice-Hall, Inc., Upper Saddle River (2006)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Chen, M., Gotsman, C., Wormser, C.: Distributed computation of virtual coordinates. In: Proc. SoCG 2007, pp. 210\u2013219 (2007)","DOI":"10.1145\/1247069.1247108"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-63397-9_9","volume-title":"Algorithms - ESA \u201997","author":"A. Czumaj","year":"1997","unstructured":"Czumaj, A., Strothmann, W.-B.: Bounded degree spanning trees (Extended abstract). In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 104\u2013117. Springer, Heidelberg (1997)"},{"key":"10_CR8","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. In: Proc. SODA 2008, pp. 102\u2013111 (2008)"},{"key":"10_CR9","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)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Strash, D.: Succinct Greedy Geometric Routing in the Euclidean Plane, submitted ot arXiv: 0812.3893v3 (October 2009)","DOI":"10.1007\/978-3-642-10631-6_79"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: Proc. FOCS 2008, pp. 337\u2013346 (2008)","DOI":"10.1109\/FOCS.2008.18"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-68552-4_6","volume-title":"Experimental Algorithms","author":"K.M. Lillis","year":"2008","unstructured":"Lillis, K.M., Pemmaraju, S.V.: On the efficiency of a local iterative algorithm to compute delaunay realizations. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 69\u201386. Springer, Heidelberg (2008)"},{"key":"10_CR13","first-page":"961","volume-title":"Proceedings of the 4th International Conference on Information Technology (ITNG 2007)","author":"R.B. Muhammad","year":"2007","unstructured":"Muhammad, R.B.: A distributed geometric routing algorithm for ad hoc wireless networks. In: Proceedings of the 4th International Conference on Information Technology (ITNG 2007), pp. 961\u2013963. IEEE Press, Los Alamitos (2007)"},{"key":"10_CR14","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)","DOI":"10.1109\/INFCOM.2007.221"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Rao, A., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proc. Mobicom 2003, pp. 96\u2013108 (2003)","DOI":"10.1145\/938985.938996"},{"issue":"1","key":"10_CR16","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. Theoretical Computer Science\u00a0344(1), 3\u201314 (2005)","journal-title":"Theoretical Computer Science"},{"key":"10_CR17","unstructured":"Strothmann, W.B.: Bounded degree spanning trees, Ph.D. thesis, Heinz-Nixdorf-Institut, Universit\u00e4t, Paderborn (1997)"},{"key":"10_CR18","volume-title":"Computer networks","author":"A.S. Tanenbaum","year":"2003","unstructured":"Tanenbaum, A.S.: Computer networks, 4th edn. Prentice-Hall, Inc., Upper Saddle River (2003)","edition":"4"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-13562-0_25","volume-title":"Theory and Applications of Models of Computation","author":"X. He","year":"2010","unstructured":"He, X., Zhang, H.: Schnyder greedy routing algorithm. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol.\u00a06108, pp. 271\u2013283. Springer, Heidelberg (2010)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"He, X., Zhang, H.: On Succinct Convex Greedy Drawing of 3-Connected Plane Graphs. In: The Proceedings of SODA, the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1477\u20131486 (2011)","DOI":"10.1137\/1.9781611973082.115"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T21:54:52Z","timestamp":1741211692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}