{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:44Z","timestamp":1725474644477},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488224"},{"type":"electronic","value":"9783540488248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11922377_4","type":"book-chapter","created":{"date-parts":[[2006,12,5]],"date-time":"2006-12-05T11:21:13Z","timestamp":1165317673000},"page":"31-44","source":"Crossref","is-referenced-by-count":2,"title":["On the Topologies of Local Minimum Spanning Trees"],"prefix":"10.1007","author":[{"given":"P. F.","family":"Cortese","sequence":"first","affiliation":[]},{"given":"G.","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"F.","family":"Frati","sequence":"additional","affiliation":[]},{"given":"L.","family":"Grilli","sequence":"additional","affiliation":[]},{"given":"K. A.","family":"Lehmann","sequence":"additional","affiliation":[]},{"given":"G.","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"M.","family":"Patrignani","sequence":"additional","affiliation":[]},{"given":"I. G.","family":"Tollis","sequence":"additional","affiliation":[]},{"given":"F.","family":"Trotta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"4_CR1","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(6), 609\u2013616 (2001)","journal-title":"Wireless Networks"},{"issue":"1-2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H. Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Computational Geometry. Theory and Applications\u00a09(1-2), 3\u201324 (1998)","journal-title":"Computational Geometry. Theory and Applications"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.adhoc.2003.09.005","volume":"3","author":"J. Cartigny","year":"2005","unstructured":"Cartigny, J., Ingelrest, F., Simplot-Ryl, D., Stojmenovic, I.: Localized lmst and rng based minimum-energy broadcast protocols in ad hoc networks. Ad Hoc Networks\u00a03(1), 1\u201316 (2005)","journal-title":"Ad Hoc Networks"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cortese, P.F., Di Battista, G., Frati, F., Grilli, L., Lehmann, K.A., Liotta, G., Patrignani, M., Tollis, I.G., Trotta, F.: On the topologies of local minimum spanning tree. Technical Report RT-001-06, Dip. Ing. Elettr. e dell\u2019Informaz., Univ. Perugia (2006)","DOI":"10.1007\/11922377_4"},{"key":"4_CR5","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Liotta, G., Whitesides, S.: The strength of weak proximity. In Graph Drawing, 178\u2013189 (1995)","DOI":"10.1007\/BFb0021802"},{"key":"4_CR7","unstructured":"Dolev, D., Trickey, H.: On linear area embedding of planar graphs. Technical Report Report No. STAN-CS-81-876, Department of Computer Science, Stanford University (1981)"},{"key":"4_CR8","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"M.R. Gary","year":"1979","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"9","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J.W. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE\u00a080(9), 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1016627727877","volume":"7","author":"C.E. Jones","year":"2001","unstructured":"Jones, C.E., Sivalingam, K.M., Agrawal, P., Chen, J.C.: A survey of energy efficient network protocols for wireless networks. Wireless Networks\u00a07(4), 343\u2013358 (2001)","journal-title":"Wireless Networks"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit disk graph approximation. In: Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (2004)","DOI":"10.1145\/1022630.1022634"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: A worst-case optimal and average-case efficient geometric ad-hoc routing. In: ACM MobiHoc (2003)","DOI":"10.1145\/778415.778447"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(00)00383-2","volume":"270","author":"W. Lenhart","year":"2002","unstructured":"Lenhart, W., Liotta, G.: The drawability problem for minimum weight triangulations. Theoretical Computer Science\u00a0270, 261\u2013286 (2002)","journal-title":"Theoretical Computer Science"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Li, N., Hou, J.C., Sha, L.: Design and analysis of an mst-based topology control algorithm. In: INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1209193"},{"key":"4_CR15","volume-title":"Ad Hoc Wireless Networking","author":"X.Y. Li","year":"2003","unstructured":"Li, X.Y.: Applications of computational geometry in wireless networks. In: Cheng, X., Huang, X., Du, D.Z. (eds.) Ad Hoc Wireless Networking. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/TPDS.2003.1239871","volume":"14","author":"X.Y. Li","year":"2003","unstructured":"Li, X.Y., Calinescu, G., Wan, P.J., Wang, Y.: Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems\u00a014, 1035\u20131047 (2003)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Li, X.Y., Song, W.Z., Wang, W.: A unified energy efficient topology for unicast and broadcast. In: Proc. MobiCom 2005 (2005)","DOI":"10.1145\/1080829.1080831"},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/TPDS.2004.1271184","volume":"15","author":"X.Y. Li","year":"2004","unstructured":"Li, X.Y., Stojmenovic, I., Wang, Y.: Partial delaunay triangulation and degree limited localized bluetooth scatternet formation. IEEE Transactions on Parallel and Distributed Systems\u00a015(4), 350\u2013361 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C.L. Monma","year":"1992","unstructured":"Monma, C.L., Suri, S.: Transitions in geometric minimum spanning trees. Discrete & Computational Geometry\u00a08, 265\u2013293 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Pinchasi, R., Smorodinsky, S.: On locally delaunay geometric graphs. In: Proc. 20th ACM Symposium on Computational Geometry (SoCG 2004), pp. 378\u2013382 (2004)","DOI":"10.1145\/997817.997874"},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S0218195905001622","volume":"15","author":"G. Toussaint","year":"2005","unstructured":"Toussaint, G.: Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining. International Journal of Comput. Geom. and Applications\u00a015(2), 101\u2013150 (2005)","journal-title":"International Journal of Comput. Geom. and Applications"}],"container-title":["Lecture Notes in Computer Science","Combinatorial and Algorithmic Aspects of Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11922377_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:20:41Z","timestamp":1555957241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11922377_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488224","9783540488248"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11922377_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}