{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:55:48Z","timestamp":1760043348038,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"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_22","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T09:13:28Z","timestamp":1243934008000},"page":"301-314","source":"Crossref","is-referenced-by-count":17,"title":["Efficient Sensor Placement for Surveillance Problems"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esther","family":"Ezra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashidhara K.","family":"Ganjugunte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Chen, D.Z., Ganjugunte, S.K., Misio\u0142ek, E., Sharir, M.: Stabbing convex polygons with a segment or a polygon. In: Proc. 16th European Symp. Algorithms, pp. 52\u201363 (2008)","DOI":"10.1007\/978-3-540-87744-8_5"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Hagerup, T., Ray, R., Sharir, M., Smid, M.H.M., Welzl, E.: Translating a planar object to maximize point containment. In: Proc. 10th European Symp. Algorithms, pp. 42\u201353 (2002)","DOI":"10.1007\/3-540-45749-6_8"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1072989.1072992","volume":"9","author":"N. Ahmed","year":"2005","unstructured":"Ahmed, N., Kanhere, S.S., Jha, S.: The holes problem in wireless sensor networks: a survey. ACM SIGMOBILE Mobile Comput. and Commun. Review\u00a09(2), 4\u201318 (2005)","journal-title":"ACM SIGMOBILE Mobile Comput. and Commun. Review"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Amit, Y., Mitchell, J.S.B., Packer, E.: Locating guards for visibility coverage of polygons. In: Proc. Workshop Alg. Eng. Exp., pp. 120\u2013134 (2007)","DOI":"10.1137\/1.9781611972870.12"},{"key":"22_CR5","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. In: Proc. 16th Annu. ACM-SIAM Symp. on Disc. Alg., pp. 886\u2013894 (2005)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. 8th Canad. Conf. Comput. Geom., pp. 38\u201344. Carleton University Press (1996)","DOI":"10.1515\/9780773591134-009"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Bai, X., Kumar, S., Yun, Z., Xuan, D., Lai, T.H.: Deploying wireless sensors to achieve both coverage and connectivity. In: Proc. 7th ACM MobiHoc, pp. 131\u2013142 (2006)","DOI":"10.1145\/1132905.1132921"},{"key":"22_CR8","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 Comput. Geom.\u00a014, 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"12","key":"22_CR9","doi-asserted-by":"publisher","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. Computers\u00a051(12), 1448\u20131453 (2002)","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00454-007-1328-5","volume":"37","author":"O. Cheong","year":"2007","unstructured":"Cheong, O., Efrat, A., Har-Peled, S.: Finding a guard that sees most and a shop that sells most. Discrete Comput. Geom.\u00a037(4), 545\u2013563 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Dhillon, S., Chakrabarty, K.: Sensor placement for effective coverage and surveillance in distributed sensor networks. In: Proc. IEEE Wireless Communications Network. Conf., pp. 1609\u20131614 (2003)","DOI":"10.21236\/ADA445754"},{"key":"22_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2000)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Efrat, A., Fekete, S.P., Gaddehosur, P.R., Mitchell, J.S.B., Polishchuk, V., Suomela, J.: Improved approximation algorithms for relay placement. In: Proc. 16th European Symp. Algorithms, pp. 356\u2013357 (2008)","DOI":"10.1007\/978-3-540-87744-8_30"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Efrat, A., Har-Peled, S.: Guarding galleries and terrains. In: 2nd IFIP Internat. Conf. Theo. Comp. Sci., pp. 181\u2013192 (2002)","DOI":"10.1007\/978-0-387-35608-2_16"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Efrat, A., Har-Peled, S., Mitchell, J.S.B.: Approximation algorithms for two optimal location problems in sensor networks. In: 2nd Internat. Conf. on Broadband Networks, vol.\u00a01, pp. 714\u2013723 (2005)","DOI":"10.1109\/ICBN.2005.1589677"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-001-0040-8","volume":"31","author":"S. Eidenbenz","year":"2001","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica\u00a031(1), 79\u2013113 (2001)","journal-title":"Algorithmica"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/ijoc.2.3.253","volume":"2","author":"L. Gewali","year":"1990","unstructured":"Gewali, L., Meng, A., Mitchell, J.S.B., Ntafos, S.: Path planning in 0\/1\/\u2009\u221e weighted regions with applications. ORSA J. Computing\u00a02, 253\u2013272 (1990)","journal-title":"ORSA J. Computing"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez-Ba\u0144os, H.H., Latombe, J.C.: A randomized art-gallery algorithm for sensor placement. In: Proc. 16th ACM Symp. Comput. Geom., pp. 232\u2013240 (2000)","DOI":"10.1145\/378583.378674"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Guestrin, C., Krause, A., Singh, A.P.: Near-optimal sensor placements in Gaussian processes. In: Proc. 22th Int. Conf. Machine Learn., pp. 265\u2013272 (2005)","DOI":"10.1145\/1102351.1102385"},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1177\/027836402320556412","volume":"21","author":"D. Halperin","year":"2002","unstructured":"Halperin, D.: Robust geometric computing in motion. International Journal of Robotics Research\u00a021(3), 219\u2013232 (2002)","journal-title":"International Journal of Robotics Research"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Hefeeda, M., Bagheri, M.: Randomized k-coverage algorithms for dense sensor networks. In: Proc. of 26th IEEE Intl. Conf. on Comp. Commn., pp. 2376\u20132380 (2007)","DOI":"10.1109\/INFCOM.2007.284"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: \u03b5-nets and simplex range queries. Discrete Comput. Geom.\u00a02, 127\u2013151 (1987)","journal-title":"Discrete Comput. Geom."},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. In: Proc. ACM Workshop Wireless Sensor Networks Appl. (WSNA), pp. 115\u2013121 (2003)","DOI":"10.1145\/941350.941367"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Iyengar, R., Kar, K., Banerjee, S.: Low-coordination topologies for redundancy in sensor networks. In: Proc. 6th ACM MobiHoc, pp. 332\u2013342 (2005)","DOI":"10.1145\/1062689.1062732"},{"issue":"3","key":"22_CR25","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. American Journal of Mathematics\u00a061(3), 665\u2013671 (1939)","journal-title":"American Journal of Mathematics"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02187833","volume":"7","author":"J. Koml\u00f3s","year":"1992","unstructured":"Koml\u00f3s, J., Pach, J., Woeginger, G.: Almost tight bounds for epsilon nets. Discrete Comput. Geom.\u00a07, 163\u2013173 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"22_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.-C. Latombe","year":"1991","unstructured":"Latombe, J.-C.: Robot Motion Planning. Kluwer Academic Publishers, Boston (1991)"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"22_CR29","unstructured":"McLurkin, J., Smith, J., Frankel, J., Sotkowitz, D., Blau, D., Schmidt, B.: Speaking swarmish: Human-robot interface design for large swarms of autonomous mobile robots. In: Proc. AAAI Spring Symp. (2006)"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: Proc. 20th Annu. Joint Conf. IEEE Comput. Commun. Soc., pp. 1380\u20131387 (2001)","DOI":"10.1109\/INFCOM.2001.916633"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M.: Exposure in wireless ad-hoc sensor networks. In: Proc. 7th Annu. Intl. Conf. on Mobile Computing and Networking, pp. 139\u2013150 (2001)","DOI":"10.1145\/381677.381691"},{"issue":"2","key":"22_CR32","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/S0097539793260763","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.\u00a028(2), 525\u2013540 (1999)","journal-title":"SIAM J. Comput."},{"key":"22_CR33","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley-Interscience, San Diego (1995)"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Tian, D., Georganas, N.D.: A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proc. ACM Workshop Wireless Sens. Nets. Appl (WSNA), pp. 32\u201341 (2002)","DOI":"10.1145\/570738.570744"},{"key":"22_CR35","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/B978-044482537-7\/50023-1","volume-title":"Handbook of Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art Gallery and illumination problems. In: Sack, J., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973\u20131027. Elsevier, Amsterdam (2000)"},{"key":"22_CR36","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 J. Math.\u00a0104, 1\u201316 (1998)","journal-title":"Israel J. Math."},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"Wang, Y.C., Hu, C.C., Tseng, Y.C.: Efficient deployment algorithms for ensuring coverage and connectivity of wireless sensor networks. In: Proc. IEEE Wireless Internet Conference (WICON), pp. 114\u2013121 (2005)","DOI":"10.1109\/WICON.2005.13"},{"key":"22_CR38","volume-title":"Wireless Sensor Networks: An Information Processing Approach","author":"F. Zhao","year":"2004","unstructured":"Zhao, F., Guibas, L.J.: Wireless Sensor Networks: An Information Processing Approach. Morgan Kaufmann, San Francisco (2004)"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T03:41:10Z","timestamp":1710387670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02085-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020841","9783642020858"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02085-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}