{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:57:04Z","timestamp":1648929424524},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,12,20]],"date-time":"2009-12-20T00:00:00Z","timestamp":1261267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s11590-009-0167-0","type":"journal-article","created":{"date-parts":[[2009,12,18]],"date-time":"2009-12-18T23:22:44Z","timestamp":1261178564000},"page":"371-381","source":"Crossref","is-referenced-by-count":5,"title":["Hybrid approximation for minimum-cost target coverage in wireless sensor networks"],"prefix":"10.1007","volume":"4","author":[{"given":"Zheng","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,20]]},"reference":[{"key":"167_CR1","unstructured":"Cardei, M., Wu, J.: Coverage in wireless sensor networks. In: Ilyas, M., Magboub, I. (eds.) Handbook of Sensor Networks. CRC Press (2004)"},{"issue":"12","key":"167_CR2","doi-asserted-by":"crossref","first-page":"1448","DOI":"10.1109\/TC.2002.1146711","volume":"51","author":"K. Chakrabarty","year":"2002","unstructured":"Chakrabarty K., Iyengar S.S., Qi H., Cho E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. Comput. 51(12), 1448\u20131453 (2002)","journal-title":"IEEE Trans. Comput."},{"key":"167_CR3","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D. Hochbaum","year":"1997","unstructured":"Hochbaum D.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Hochbaum, D. (eds) Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston (1997)"},{"key":"167_CR4","first-page":"526","volume":"28","author":"S. Rajagopalan","year":"1999","unstructured":"Rajagopalan S., Vazirani V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28, 526\u2013541 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"167_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/15501320490886323","volume":"1","author":"S. Sahni","year":"2005","unstructured":"Sahni S., Xu X.: Algorithms for wireless sensor networks. Int. J. Distr. Sensor Netw. 1(1), 35\u201356 (2005)","journal-title":"Int. J. Distr. Sensor Netw."},{"key":"167_CR6","volume-title":"Approximation Algorithms","author":"V.V. Vazrani","year":"2001","unstructured":"Vazrani V.V.: Approximation Algorithms. Springer, New York (2001)"},{"key":"167_CR7","doi-asserted-by":"crossref","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. J. Comb. Optim. 11, 291\u2013305 (2006)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"167_CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1504\/IJSNET.2008.018478","volume":"3","author":"J. Wang","year":"2008","unstructured":"Wang J., Zhong N.: Minimum-cost sensor arrangement for achieving wanted coverage lifetime. Int. J. Sensor Netw. 3(3), 165\u2013174 (2008)","journal-title":"Int. J. Sensor Netw."},{"key":"167_CR9","doi-asserted-by":"crossref","unstructured":"Yu, Z., Wang, J.: Reliable sensor arrangement for achieving wanted coverage lifetime with minimum cost. In: Proceedings of the 2nd International Conference on Wireless Algorithms, Systems and Applications (WASA\u201907), Chicago, pp. 95\u2013102. IEEE Computer Society Press, August 2007","DOI":"10.1109\/WASA.2007.16"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0167-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-009-0167-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0167-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:15:04Z","timestamp":1559560504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-009-0167-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,20]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s11590-009-0167-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,20]]}}}