{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:02:20Z","timestamp":1725577340818},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190551"},{"type":"electronic","value":"9783642190568"}],"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-19056-8_14","type":"book-chapter","created":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T00:55:03Z","timestamp":1296608103000},"page":"197-208","source":"Crossref","is-referenced-by-count":1,"title":["k th Order Geometric Spanners for Wireless Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Prabhat","family":"Kiran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. V.","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, New York (2007)"},{"unstructured":"Cheng, X., Huang, X., Li, X.Y.: Applications of computational geometry in wireless networks (2003)","key":"14_CR2"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognition\u00a012, 261\u2013268 (1980)","journal-title":"Pattern Recognition"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/S0895480197318088","volume":"20","author":"P. Bose","year":"2006","unstructured":"Bose, P., Devroye, L., Evans, W., Kirkpatrick, D.: On the spanning ratio of gabriel graphs and beta-skeletons. SIAM J. Discret. Math.\u00a020(2), 412\u2013427 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-51542-9_6","volume-title":"Algorithms and Data Structures","author":"J.M. Keil","year":"1989","unstructured":"Keil, J.M., Gutwin, C.A.: The Delaunay triangulation closely approximates the complete Euclidean graph. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol.\u00a0382, pp. 47\u201356. Springer, Heidelberg (1989)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D.P. Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry\u00a05, 399\u2013407 (1990)","journal-title":"Discrete & Computational Geometry"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/10515.10534","volume-title":"Proceedings of the Second Annual Symposium on Computational Geometry, SCG 1986","author":"P. Chew","year":"1986","unstructured":"Chew, P.: There is a planar graph almost as good as the complete graph. In: Proceedings of the Second Annual Symposium on Computational Geometry, SCG 1986, pp. 169\u2013177. ACM, New York (1986)"},{"unstructured":"Li, X.Y., Calinescu, G., Wan, P.J.: Distributed construction of planar spanner and routing for ad hoc wireless networks. In: INFOCOM (2002)","key":"14_CR8"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-52921-7_55","volume-title":"Algorithms","author":"M.S. Chang","year":"1990","unstructured":"Chang, M.S., Tang, C.Y., Lee, R.C.T.: 20-relative neighborhood graphs are hamiltonian. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol.\u00a0450, pp. 53\u201365. Springer, Heidelberg (1990)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(92)90111-M","volume":"39","author":"M.S. Chang","year":"1992","unstructured":"Chang, M.S., Tang, C.Y., Lee, R.C.T.: Solving the euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs. Discrete Applied Mathematics\u00a039, 1\u201312 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01758842","volume":"8","author":"M. Chang","year":"1992","unstructured":"Chang, M., Tang, C., Lee, R.: Solving the euclidean bottleneck matching problem by k-relative neighborhood graphs. Algorithmica\u00a08, 177\u2013194 (1992), doi:10.1007\/BF01758842","journal-title":"Algorithmica"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1016\/S0031-3203(00)00144-8","volume":"34","author":"S.V. Rao","year":"2001","unstructured":"Rao, S.V., Mukhopadhyay, A.: Fast algorithms for computing beta-skeletons and their relatives. Pattern Recognition\u00a034, 2163\u20132172 (2001)","journal-title":"Pattern Recognition"},{"doi-asserted-by":"crossref","unstructured":"Kiran, P.: kth order geometric spanners for wireless ad hoc networks. Master\u2019s thesis, Indian Institute of Technology Guwahati (2010)","key":"14_CR13","DOI":"10.1007\/978-3-642-19056-8_14"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19056-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:18:51Z","timestamp":1559981931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19056-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190551","9783642190568"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19056-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}