{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:33Z","timestamp":1759638513293,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020841"},{"type":"electronic","value":"9783642020858"}],"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-02085-8_18","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T09:13:28Z","timestamp":1243934008000},"page":"245-258","source":"Crossref","is-referenced-by-count":8,"title":["Cheap or Flexible Sensor Coverage"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodore","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew P.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H., Arkin, E.M., Bronnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: SoCG 2006 (2006)","DOI":"10.1145\/1137856.1137922"},{"key":"18_CR2","volume-title":"Data Networks","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Gallager, R.G.: Data Networks, 2nd edn. Prentice Hall, Englewood Cliffs (1991)","edition":"2"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11561071_42","volume-title":"Algorithms \u2013 ESA 2005","author":"V. Bil\u00f3","year":"2005","unstructured":"Bil\u00f3, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 460\u2013471. Springer, Heidelberg (2005)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Brass, P.: Bounds on coverage and target detection capabilities for models of networks of mobile sensors. ACM T. on Sensor Networks\u00a03(2) (2007)","DOI":"10.1145\/1240226.1240229"},{"key":"18_CR5","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: SODA 2001 (2001)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Gibson, M., Kanade, G., Krohn, E., Pirwani, I., Varadarajan, K.: On clustering to minimize the sum of radii. In: SODA 2008 (2008)","DOI":"10.1007\/s00453-009-9282-7"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Hefeeda, M., Ahmadi, H.: A probabilistic coverage protocol for wireless sensor networks. In: ICNP 2007 (2007)","DOI":"10.1109\/ICNP.2007.4375835"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM\u00a032(1) (1985)","DOI":"10.1145\/2455.214106"},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s11036-005-1564-y","volume":"10","author":"C.-F. Huang","year":"2005","unstructured":"Huang, C.-F., Tseng, Y.-C.: The coverage problem in a wireless sensor network. Mobile Networks and Applications\u00a010(4), 519\u2013528 (2005)","journal-title":"Mobile Networks and Applications"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms\u00a026(2) (1998)","DOI":"10.1006\/jagm.1997.0903"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Johnson, M.P., Sarioz, D., Bar-Noy, A., Brown, T., Verma, D., Wu, C.-W.: More is more: the benefits of denser sensor deployment. In: INFOCOM 2009 (2009)","DOI":"10.1109\/INFCOM.2009.5061942"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"665","DOI":"10.2307\/2371320","volume":"61","author":"R. Kershner","year":"1939","unstructured":"Kershner, R.: The number of circles covering a set. Amer. J. Math.\u00a061, 665\u2013671 (1939)","journal-title":"Amer. J. Math."},{"key":"18_CR13","unstructured":"Lenchner, J.: A faster dynamic programming algorithm for facility location. In: FWCG 2006 (2006)"},{"issue":"4","key":"18_CR14","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N. Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Computer Networks\u00a047(4), 489\u2013501 (2005)","journal-title":"Computer Networks"},{"key":"18_CR15","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, H., Hou, J.: Maintaining sensing coverage and connectivity in large sensor networks. In: WTASA 2004 (2004)","DOI":"10.1201\/9780203323687.ch28"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing in Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02085-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T12:22:54Z","timestamp":1685017374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02085-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020841","9783642020858"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02085-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}