{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:09Z","timestamp":1725544749472},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_29","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"286-297","source":"Crossref","is-referenced-by-count":12,"title":["Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges"],"prefix":"10.1007","author":[{"given":"Edgar","family":"Ch\u00e1vez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Dobrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslav","family":"Opatrny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladislav","family":"Stacho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.: Euclidean spanners: Short, thin, and lanky. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, Las Vegas, Nevada, 29 May\u20131 June, pp. 489\u2013498 (1995)","DOI":"10.1145\/225058.225191"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02523237","volume":"17","author":"S. Arya","year":"1997","unstructured":"Arya, S., Smid, M.: Efficient construction of a bounded degree spanner with low weight. Algorithmica\u00a017, 33\u201354 (1997)","journal-title":"Algorithmica"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Barri\u2018ere, L., Fraigniaud, P., Narayanan, L., Opatrny, J.: Robust position-based routing in wireless ad-hoc networks with irregular transmission ranges. Wireless Communications and Mobile Computing Journal (2003)","DOI":"10.1002\/wcm.108"},{"key":"29_CR4","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. Algorithmica (to appear)"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks\u00a07, 609\u2013616 (2001)","journal-title":"Wireless Networks"},{"key":"29_CR6","first-page":"215","volume-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995","author":"G. Das","year":"1995","unstructured":"Das, G., Salowe, G.N.J.: A new way to weigh malnourished euclidean graphs. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, San Francisco, California, January 22-24, ACM SIGACT, pp. 215\u2013222. SIAM, Philadelphia (1995)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Doyle, P., Snell, J.: Random Walks and Electric Networks. The Carus Mathematical Monographs. The Mathematical Association of America (1984)","DOI":"10.5948\/UPO9781614440222"},{"key":"29_CR8","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry. Elsevier, Amsterdam (2000)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K.R. Gabriel","year":"1972","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Systemic Zoology\u00a018, 259\u2013278 (1972)","journal-title":"Systemic Zoology"},{"issue":"2","key":"29_CR10","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. Hunt III","year":"1998","unstructured":"Hunt III, H.B., Marathe, M., Radhakrishnan, V., Ravi, S., Rosenkrantz, D., Stearns, R.: Nc-approximation schemes for np- and pspace-hard problems for geometric graphs. J. Algorithms\u00a026(2), 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"key":"29_CR11","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. of 11th Canadian Conference on Computational Geometry, pp. 51\u201354 (August 1999)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal Jr.","year":"1956","unstructured":"Kruskal Jr., J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc.\u00a07, 48\u201350 (1956)","journal-title":"Proc. Amer. Math. Soc."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/872035.872044","volume-title":"Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (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: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003), Boston, Massachusetts, USA, July 13-16, pp. 63\u201372. ACM, New York (2003)"},{"key":"29_CR14","first-page":"24","volume-title":"Proceedings of 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M)","author":"F. Kuhn","year":"2002","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: Proceedings of 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M), pp. 24\u201333. ACM Press, New York (2002)"},{"key":"29_CR15","unstructured":"Li, X.-Y., Calinescu, G., Wan, P.-J.: Distributed construction of planar spanner and routing for ad hoc wireless networks. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM 2002), Piscataway, NJ, USA, June 23\u201327, pp. 1268\u20131277 (2002)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Li, X.-Y., Wang, Y.: Efficient construction of low weight bounded degree planar spanner. In: COCOON: Annual International Conference on Computing and Combinatorics (2003)","DOI":"10.1007\/3-540-45071-8_38"},{"key":"29_CR17","unstructured":"Li, X.-Y., Wang, Y., Song, W.-Z.: Applications of k-local mst for topology control and broadcasting in wireless ad hoc networks. In: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM 2004), Piscataway, NJ, USA, March 7\u201311 (2004)"},{"issue":"3","key":"29_CR18","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1137\/S0097539799361671","volume":"30","author":"G. Narasimhan","year":"2001","unstructured":"Narasimhan, G., Smid, M.: Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing\u00a030(3), 978\u2013989 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR19","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 neighborhood graph of a finite set. Pattern Recognition\u00a012, 261\u2013268 (1980)","journal-title":"Pattern Recognition"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, X.-Y.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In: DialM: Proceedings of the Discrete Algorithms and Methods for Mobile Computing & Communications (2003)","DOI":"10.1145\/941079.941088"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T19:49:11Z","timestamp":1586720951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11682462_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}