{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:24Z","timestamp":1725798684533},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_18","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"201-212","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Analysis of Power Assignments"],"prefix":"10.1007","author":[{"given":"Maurits","family":"de Graaf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodo","family":"Manthey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11276-005-5275-x","volume":"12","author":"E. Althaus","year":"2006","unstructured":"Althaus, E., Calinescu, G., Mandoiu, I.I., Prasad, S.K., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Networks\u00a012(3), 287\u2013299 (2006)","journal-title":"Wireless Networks"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00453-012-9643-5","volume":"66","author":"M. Bl\u00e4ser","year":"2013","unstructured":"Bl\u00e4ser, M., Manthey, B., Rao, B.V.R.: Smoothed analysis of partitioning algorithms for Euclidean functionals. Algorithmica\u00a066(2), 397\u2013418 (2013)","journal-title":"Algorithmica"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-31155-0_20","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"M. Bl\u00e4ser","year":"2012","unstructured":"Bl\u00e4ser, M., Panagiotou, K., Rao, B.V.R.: A probabilistic analysis of Christofides\u2019 algorithm. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 225\u2013236. Springer, Heidelberg (2012)"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","volume":"9","author":"A.E.F. Clementi","year":"2004","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Networks and Applications\u00a09(2), 125\u2013140 (2004)","journal-title":"Mobile Networks and Applications"},{"issue":"6","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.adhoc.2010.08.016","volume":"9","author":"S. Funke","year":"2011","unstructured":"Funke, S., Laue, S., Lotker, Z., Naujoks, R.: Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours. Ad Hoc Networks\u00a09(6), 1028\u20131035 (2011)","journal-title":"Ad Hoc Networks"},{"key":"18_CR6","unstructured":"de Graaf, M., Boucherie, R.J., Hurink, J.L., van Ommeren, J.K.: An average case analysis of the minimum spanning tree heuristic for the range assignment problem. Memorandum 11259 (revised version), Department of Applied Mathematics, University of Twente (2013)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Holzer, S., Mitra, P., Wattenhofer, R.: The power of non-uniform wireless power. In: Proc. of the 24th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1595\u20131606. SIAM (2013)","DOI":"10.1137\/1.9781611973105.114"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless connectivity and capacity. In: Rabani, Y. (ed.) Proc. of the 23rd Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 516\u2013526. SIAM (2012)","DOI":"10.1137\/1.9781611973099.44"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: Proc. of the 22nd Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1549\u20131559. SIAM (2011)","DOI":"10.1137\/1.9781611973082.120"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-33651-5_32","volume-title":"Distributed Computing","author":"M. Khan","year":"2012","unstructured":"Khan, M., Pandurangan, G., Pei, G., Vullikanti, A.K.S.: Brief announcement: A fast distributed approximation algorithm for minimum spanning trees in the SINR model. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 409\u2013410. Springer, Heidelberg (2012)"},{"issue":"1-2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., 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"},{"issue":"1-2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/B:MONE.0000048543.95178.f5","volume":"10","author":"E.L. Lloyd","year":"2005","unstructured":"Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. Mobile Networks and Applications\u00a010(1-2), 19\u201334 (2005)","journal-title":"Mobile Networks and Applications"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Pahlavan, K., Levesque, A.H.: Wireless Information Networks. Wiley (1995)","DOI":"10.1117\/12.192184"},{"key":"18_CR14","unstructured":"Rappaport, T.S.: Wireless Communication. Prentice Hall (2002)"},{"key":"18_CR15","unstructured":"Warnke, L.: On the method of typical bounded differences. Computing Research Repository 1212.5796 [math.CO], arXiv (2012)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Yukich, J.E.: Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Mathematics, vol. 1675. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0093472"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T06:21:23Z","timestamp":1717222883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}