{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:37:19Z","timestamp":1725601039109},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_3","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T12:35:19Z","timestamp":1313584519000},"page":"25-35","source":"Crossref","is-referenced-by-count":6,"title":["Minimum-Cost Linear Coverage by Sensors with Adjustable Ranges"],"prefix":"10.1007","author":[{"given":"Minming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianwei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingchao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_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":"3_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)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, 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":"3_CR4","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":"3_CR5","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":"3_CR6","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":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-12450-1_13","volume-title":"Approximation and Online Algorithms","author":"T. Erlebach","year":"2010","unstructured":"Erlebach, T., Mihal\u00e1k, M.: A (4 + \u03b5)-approximation for the minimum-weight dominating set problem in unit disk graphs. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"issue":"4","key":"3_CR8","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. Information Processing Letters\u00a040(4), 181\u2013188 (1991)","journal-title":"Information Processing Letters"},{"issue":"1","key":"3_CR9","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":"3_CR10","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"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10878-008-9146-0","volume":"18","author":"Y. Huang","year":"2009","unstructured":"Huang, Y., Gao, X., Zhang, Z., Wu, W.: A better constant-factor approximation for weighted dominating set in unit disk graph. Journal of Combinatorial Optimization\u00a018(2), 179\u2013194 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"3_CR12","unstructured":"Narayanappa, S., Vojtechovsk\u1ef3, P.: An improved approximation factor for the unit disk covering problem. In: Canadian Conference on Computational Geometry, Citeseer (2006)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Xu, X.-H., Wang, Z.: Wireless Coverage with Disparate Ranges. In: ACM MOBIHOC (2011)","DOI":"10.1145\/2107502.2107517"},{"key":"3_CR14","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":"3_CR15","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":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1109\/TNET.2010.2040191","volume":"18","author":"Z. Yun","year":"2010","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), 934\u2013947 (2010)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.tcs.2009.06.022","volume":"412","author":"F. Zou","year":"2011","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\u00a0412(3), 198\u2013208 (2011) (Journal version of a COCOA 2009 paper)","journal-title":"Theoretical Computer Science"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T22:36:12Z","timestamp":1638311772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23490-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642234897","9783642234903"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23490-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}