{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:37:24Z","timestamp":1725601044368},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642234897"},{"type":"electronic","value":"9783642234903"}],"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-23490-3_10","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:35:19Z","timestamp":1313570119000},"page":"108-118","source":"Crossref","is-referenced-by-count":1,"title":["Wireless Coverage via Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Xiaohua","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/984622.984684","volume-title":"Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks","author":"Z. Abrams","year":"2004","unstructured":"Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, pp. 424\u2013432. ACM, New York (2004)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11830924_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 3\u201314. Springer, Heidelberg (2006)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Baysan, M., Sarac, K., Chandrasekaran, R., Bereg, S.: A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model. IEEE Transactions on Parallel and Distributed Systems, 913\u2013924 (2008)","DOI":"10.1109\/TPDS.2008.169"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Br\u201donnimann","year":"1995","unstructured":"Br\u201donnimann, H., Goodrich, M.: Almost optimal set covers in finite VC-dimension. Discrete and Computational Geometry\u00a014(1), 463\u2013479 (1995)","journal-title":"Discrete and Computational Geometry"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:MONE.0000013622.63511.57","volume":"9","author":"G. C\u0103linescu","year":"2004","unstructured":"C\u0103linescu, G., Mandoiu, I., Wan, P., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks and Applications\u00a09(2), 101\u2013111 (2004)","journal-title":"Mobile Networks and Applications"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Carmi, P., Katz, M., Lev-Tov, N.: Covering points by unit disks of fixed location. Algorithms and Computation, 644\u2013655 (2007)","DOI":"10.1007\/978-3-540-77120-3_56"},{"issue":"8-10","key":"10_CR7","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.tcs.2008.11.015","volume":"410","author":"D. Dai","year":"2009","unstructured":"Dai, D., Yu, C.: A 5\u2009+\u2009\u03b5-approximation algorithm for minimum weighted dominating set in unit disk graph. Theoretical Computer Science\u00a0410(8-10), 756\u2013765 (2009)","journal-title":"Theoretical Computer Science"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Mihal\u00e1k, M.: A (4+ \u03b5)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. Approximation and Online Algorithms, 135\u2013146 (2010)","DOI":"10.1007\/978-3-642-12450-1_13"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(91)90075-S","volume":"40","author":"T. Gonzalez","year":"1991","unstructured":"Gonzalez, T.: Covering a set of points in multidimensional space* 1. Information Processing Letters\u00a040(4), 181\u2013188 (1991)","journal-title":"Information Processing Letters"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM (JACM)\u00a032(1), 130\u2013136 (1985)","journal-title":"Journal of the ACM (JACM)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Hou, J., Yau, D., Ma, C., Yang, Y., Zhang, H., Hou, I., Rao, N., Shankar, M.: Coverage in wireless sensor networks. Guide to Wireless Sensor Networks, 47\u201379 (2009)","DOI":"10.1007\/978-1-84882-218-4_3"},{"key":"10_CR12","first-page":"6905","volume":"1382","author":"Y. Huang","year":"2008","unstructured":"Huang, Y., et al.: A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim.\u00a01382, 6905 (2008)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(92)90052-E","volume":"13","author":"D. Johnson","year":"1992","unstructured":"Johnson, D.: The NP-completeness column: an ongoing guide. Journal of Algorithms\u00a013(3), 502\u2013524 (1992)","journal-title":"Journal of Algorithms"},{"key":"10_CR14","unstructured":"Narayanappa, S., Vojtechovsk\u1ef3, P.: An improved approximation factor for the unit disk covering problem. In: Proc. Can. Conf. on Comp. Geom., Citeseer (2006)"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1145\/258533.258641","volume-title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing","author":"R. Raz","year":"1997","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 475\u2013484. ACM, New York (1997)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Wan, P., Xu, X., Wang, Z.: Wireless Coverage with Disparate Ranges. In: ACM MobiHoc (2011)","DOI":"10.1145\/2107502.2107517"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1109\/TIT.2005.862092","volume":"52","author":"P. Wan","year":"2006","unstructured":"Wan, P., Yi, C.: Coverage by randomly deployed wireless sensor networks. IEEE Transactions on Information Theory\u00a052, 2658\u20132669 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10878-006-7909-z","volume":"11","author":"J. Wang","year":"2006","unstructured":"Wang, J., Zhong, N.: Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization\u00a011(3), 291\u2013304 (2006)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/wcm.109","volume":"3","author":"J. Wu","year":"2003","unstructured":"Wu, J., Lou, W.: Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing\u00a03(2), 155\u2013173 (2003)","journal-title":"Wireless Communications and Mobile Computing"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Yun, Z., Bai, X., Xuan, D., Lai, T., Jia, W.: Optimal Deployment Patterns for Full Coverage and k-Connectivity (k\u2009\u2264\u20096) Wireless Sensor Networks. IEEE\/ACM Transactions on Networking\u00a018(3) (2010)","DOI":"10.1109\/TNET.2010.2040191"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Zou, F., Wang, Y., Xu, X., Li, X., Du, H., Wan, P., Wu, W.: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoretical Computer Science (2011)","DOI":"10.1016\/j.tcs.2009.06.022"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23490-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T17:03:23Z","timestamp":1686243803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23490-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642234897","9783642234903"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23490-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}