{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:25Z","timestamp":1725558385653},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_23","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"236-247","source":"Crossref","is-referenced-by-count":1,"title":["The MST of Symmetric Disk Graphs Is Light"],"prefix":"10.1007","author":[{"given":"A. Karim","family":"Abu-Affash","sequence":"first","affiliation":[]},{"given":"Rom","family":"Aschner","sequence":"additional","affiliation":[]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete and Computational Geometry\u00a09(1), 81\u2013100 (1993)","journal-title":"Discrete and Computational Geometry"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the symmetric range assignment problem in wireless ad hoc networks. In: TCS\u201902: Proc. of the IFIP 17th World Computer Congress \u2013 TC1 Stream \/ 2nd IFIP International Conference on Theoretical Computer Science, pp. 71\u201382 (2002)","DOI":"10.1007\/978-0-387-35608-2_7"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"C\u0103linescu, G., M\u0103ndoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: TCS\u201902: Proc. of the IFIP 17th World Computer Congress \u2013 TC1 Stream \/ 2nd IFIP International Conference on Theoretical Computer Science, pp. 119\u2013130 (2002)","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1142\/S0218195995000088","volume":"5","author":"B. Chandra","year":"1995","unstructured":"Chandra, B., Das, G., Narasimhan, G., Soares, J.: New sparseness results on graph spanners. Internat. J. of Computational Geometry and Applications\u00a05, 125\u2013144 (1995)","journal-title":"Internat. J. of Computational Geometry and Applications"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-48413-4_21","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"A.E.F. Clementi","year":"1999","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 197\u2013208. Springer, Heidelberg (1999)"},{"key":"23_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1-2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L. Kirousis","year":"2000","unstructured":"Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science\u00a0243(1-2), 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"23_CR8","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, Cambridge (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:21Z","timestamp":1606185741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}