{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:48:58Z","timestamp":1742924938822,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034169"},{"type":"electronic","value":"9783642034176"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03417-6_11","type":"book-chapter","created":{"date-parts":[[2009,8,5]],"date-time":"2009-08-05T03:57:54Z","timestamp":1249444674000},"page":"104-114","source":"Crossref","is-referenced-by-count":7,"title":["\u03b5-Net Approach to Sensor k-Coverage"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Fusco","sequence":"first","affiliation":[]},{"given":"Himanshu","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Gupta, H., Zhou, Z., Das, S., Gu, Q.: Connected sensor cover: Self-organization of sensor networks for efficient query execution. TON\u00a014(1) (2006)","key":"11_CR1","DOI":"10.1109\/TNET.2005.863478"},{"doi-asserted-by":"crossref","unstructured":"Charkrabarty, K., Iyengar, S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. Transaction on Computers (2002)","key":"11_CR2","DOI":"10.1109\/TC.2002.1146711"},{"unstructured":"Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor ad-hoc networks. In: ICC (2001)","key":"11_CR3"},{"doi-asserted-by":"crossref","unstructured":"Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M.: Exposure in wireless ad-hoc sensor networks. In: MobiCom (2001)","key":"11_CR4","DOI":"10.1145\/381677.381691"},{"key":"11_CR5","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press\/ McGraw-Hill, Cambridge (2001)","edition":"2"},{"issue":"4","key":"11_CR6","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.T.: Almost optimal set covers in finite vc-dimension. Discrete & Computational Geometry\u00a014(4), 463\u2013479 (1995)","journal-title":"Discrete & Computational Geometry"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discrete & Computational Geometry\u00a02, 127\u2013151 (1987)","journal-title":"Discrete & Computational Geometry"},{"doi-asserted-by":"crossref","unstructured":"Hefeeda, M., Bagheri, M.: Randomized k-coverage algorithms for dense sensor networks. In: INFOCOM, pp. 2376\u20132380 (2007)","key":"11_CR8","DOI":"10.1109\/INFCOM.2007.284"},{"unstructured":"Ye, F., Zhong, G., Lu, S., Zhang, L.: Peas: A robust energy conserving protocol for long-lived sensor networks. In: ICDCS (2003)","key":"11_CR9"},{"doi-asserted-by":"crossref","unstructured":"Shakkottai, S., Srikant, R., Shroff, N.: Unreliable sensor grids: Coverage, connectivity and diameter. In: INFOCOM (2003)","key":"11_CR10","DOI":"10.1109\/INFCOM.2003.1208944"},{"unstructured":"Zhou, Z., Das, S.R., Gupta, H.: Connected k-coverage problem in sensor networks. In: ICCCN, pp. 373\u2013378 (2004)","key":"11_CR11"},{"doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J., Seidel, R., Welzl, E.: How to net a lot with little: Small \u03b5-nets for disks and halfspaces. In: SCG, pp. 16\u201322 (1990)","key":"11_CR12","DOI":"10.1145\/98524.98530"},{"key":"11_CR13","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms, vol.\u00a03. Oxford University Press, New York (1987)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02897056","volume":"104","author":"P. Valtr","year":"1998","unstructured":"Valtr, P.: Guarding galleries where no point sees a small area. Israel Journal of Mathematics\u00a0104, 1\u201316 (1998)","journal-title":"Israel Journal of Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Fusco, G., Gupta, H.: \u03b5-net approach to sensor k-coverage. Technical report, Stony Brook University (2009), http:\/\/www.cs.sunysb.edu\/~fusco\/publications.html","key":"11_CR15","DOI":"10.1007\/978-3-642-03417-6_11"},{"doi-asserted-by":"crossref","unstructured":"Fusco, G., Gupta, H.: Selection and orientation of directional sensors for coverage maximization. In: SECON (2009)","key":"11_CR16","DOI":"10.1109\/SAHCN.2009.5168968"}],"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-03417-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T17:25:04Z","timestamp":1558459504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03417-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034169","9783642034176"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03417-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}