{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:24Z","timestamp":1725536004689},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_49","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"566-577","source":"Crossref","is-referenced-by-count":2,"title":["Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Chenyu","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. of Algorithms\u00a052, 134\u2013151 (2004)","journal-title":"J. of Algorithms"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TPDS.2003.1195412","volume":"14","author":"K. Alzoubi","year":"2003","unstructured":"Alzoubi, K., Li, X.-Y., Wang, Y., Wan, P.-J., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Trans. on Par. and Distr. Syst.\u00a014, 408\u2013421 (2003)","journal-title":"IEEE Trans. on Par. and Distr. Syst."},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J.: Unit Disk Graphs. Discrete Math.\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"49_CR4","first-page":"48","volume-title":"3rd Internat. workshop on discr. algor. and methods for mobile computing and communications","author":"P. Bose","year":"1999","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: 3rd Internat. workshop on discr. algor. and methods for mobile computing and communications, pp. 48\u201355. ACM Press, New York (1999)"},{"issue":"2","key":"49_CR5","first-page":"97","volume":"10","author":"F.F. Dragan","year":"2006","unstructured":"Dragan, F.F., Yan, C., Corneil, D.G.: Collective Tree Spanners and Routing in AT-free Related Graphs. J. of Graph Algor. and Applic.\u00a010(2), 97\u2013122 (2006)","journal-title":"J. of Graph Algor. and Applic."},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/S089548010444167X","volume":"20","author":"F.F. Dragan","year":"2006","unstructured":"Dragan, F.F., Yan, C., Lomonosov, I.: Collective tree spanners of graphs. SIAM J. Discrete Math.\u00a020, 241\u2013260 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"49_CR7","unstructured":"Fonseca, R., Ratnasamy, S., Zhao, J., Ee, C.T., Culler, D., Shenker, S., Stoica, I.: Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In: 2nd USENIX\/ACM Symp. on Netw. Syst. Design and Implement (NSDI 2005) (2005)"},{"key":"49_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-73951-7_28","volume-title":"Algorithms and Data Structures","author":"M. F\u00fcrer","year":"2007","unstructured":"F\u00fcrer, M., Kasiviswanathan, S.P.: Spanners for geometric intersection graphs. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 312\u2013324. Springer, Heidelberg (2007)"},{"key":"49_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in Trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: 2nd ACM international symposium on mobile ad hoc networking & computing, Long Beach, CA, USA, October 04-05 (2001)","DOI":"10.1145\/501416.501424"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhang, L.: Well-separated pair decomposition for the unit-disk graph metric and its applications. In: STOC 2003, pp. 483\u2013492 (2003)","DOI":"10.1145\/780542.780613"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-1-4613-0223-0_4","volume-title":"Ad Hoc Wireless Networking","author":"S. Giordano","year":"2004","unstructured":"Giordano, S., Stojmenovic, I.: Position based routing algorithms for ad hoc networks: A taxonomy. In: Ad Hoc Wireless Networking, pp. 103\u2013136. Kluwer, Dordrecht (2004)"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Rastogi, R.: Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). In: FOCS 2001, pp. 148\u2013157 (2001)","DOI":"10.1109\/SFCS.2001.959889"},{"key":"49_CR14","first-page":"243","volume-title":"Proceedings of the 6th ACM\/IEEE MobiCom","author":"B. Karp","year":"2000","unstructured":"Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th ACM\/IEEE MobiCom, pp. 243\u2013254. ACM Press, New York (2000)"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Kleinberg, R.: Geographic routing using hyperbolic space. In: INFOCOM 2007, pp. 1902\u20131909 (2007)","DOI":"10.1109\/INFCOM.2007.221"},{"key":"49_CR16","first-page":"63","volume-title":"PODC 2003","author":"F. Kuhn","year":"2003","unstructured":"Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: PODC 2003, pp. 63\u201372. ACM Press, New York (2003)"},{"key":"49_CR17","volume-title":"Applications of Computational Geomety in Wireless Ad Hoc Networks","author":"X.-Y. Li","year":"2003","unstructured":"Li, X.-Y.: Ad Hoc Wireless Networking. In: Li, X.-Y. (ed.) Applications of Computational Geomety in Wireless Ad Hoc Networks, Kluwer, Dordrecht (2003)"},{"key":"49_CR18","volume-title":"Handbook of Approx. Algorithms and Metaheuristics","author":"X.-Y. Li","year":"2006","unstructured":"Li, X.-Y., Wang, Y.: Geometrical Spanner for Wireless Ad Hoc Networks. In: Handbook of Approx. Algorithms and Metaheuristics. Chapman&Hall\/Crc, Boca Raton (2006)"},{"key":"49_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A Separator Theorem for Planar Graphs. SIAM Journal on Applied Mathematics\u00a036, 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"49_CR20","series-title":"SIAM Monographs on Discrete Math. Appl.","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Math. Appl. SIAM, Philadelphia (2000)"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Rao, A., Papadimitriou, C., Shenker, S., Stoica, I.: Geographical routing without location information. In: MobiCom 2003, pp. 96\u2013108 (2003)","DOI":"10.1145\/938985.938996"},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. In: FOCS, pp. 242\u2013251 (2001)","DOI":"10.1109\/SFCS.2001.959898"},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"49_CR24","unstructured":"Yan, C.: Approximating Distances in Complicated Graphs by Distances in Simple Graphs With Applications. PhD Dissertation, Kent State University (2007), http:\/\/www.ohiolink.edu\/etd\/send-pdf.cgi\/Yan%20Chenyu.pdf?kent1184639623"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:28:51Z","timestamp":1558438131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}