{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T21:07:18Z","timestamp":1790024838738,"version":"4.0.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T00:00:00Z","timestamp":1147046400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2007,4]]},"DOI":"10.1007\/s11276-006-3724-9","type":"journal-article","created":{"date-parts":[[2006,5,9]],"date-time":"2006-05-09T11:36:44Z","timestamp":1147174604000},"page":"153-164","source":"Crossref","is-referenced-by-count":60,"title":["Improved approximation algorithms for connected sensor cover"],"prefix":"10.1007","volume":"13","author":[{"given":"Stefan","family":"Funke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Kesselman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,8]]},"reference":[{"key":"3724_CR1","doi-asserted-by":"crossref","unstructured":"Z. Abrams, A. Goel and S. Plotkin, Set k-cover algorithms for energy efficient monitoring in wireless sensor networks, in Proc. of Third International Symposium on Information Processing in Sensor Networks (IPSN) (2004).","DOI":"10.1145\/984622.984684"},{"key":"3724_CR2","doi-asserted-by":"crossref","unstructured":"I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, Wireless sensor networks: A survey, Computer Networks (March 2002).","DOI":"10.1016\/S1389-1286(01)00302-4"},{"key":"3724_CR3","unstructured":"P. Berman, G. Calinescu, C. Shah and A. Zelikovsky, Power efficient monitoring management in sensor networks, in IEEE Wireless Communication and Networking Conference (WCNC\u201904), Atlanta, (March 2004)."},{"key":"3724_CR4","doi-asserted-by":"crossref","unstructured":"B. Badrinath, M. Srivastava, K. Mills, J.S Holtz and K. Sollins, Editors, Special issue on smart spaces and environments, in IEEE Personal Communications (2000).","DOI":"10.1109\/MPC.2000.878529"},{"key":"3724_CR5","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1142\/S0218195900000322","volume":"10","author":"B. Ben-Moshe","year":"2000","unstructured":"B. Ben-Moshe, M. J. Katz and M. Segal, Obnoxious facility location: Complete service with minimal harm, International Journal of Computational Geometry and Applications 10 (2000) 581\u2013592.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"3724_CR6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Br\u00f6nnimann","year":"1995","unstructured":"H. Br\u00f6nnimann and M. T. Goodrich, Almost optimal set covers in finite VC-dimension, Discrete and Computational Geometry 14 (1995) 463\u2013479.","journal-title":"Discrete and Computational Geometry"},{"key":"3724_CR7","doi-asserted-by":"crossref","unstructured":"P. Bose, A. Maheshwari, P Morin and J. Morrison, The grid placement problem, in Proceedings of the 7th Annual Workshop on Algorithms and Data Structures, Vol. 2125 of LNCS (2001) pp. 180\u2013191.","DOI":"10.1007\/3-540-44634-6_17"},{"key":"3724_CR8","doi-asserted-by":"crossref","unstructured":"A. Cerpa and D. Estrin, ASCENT: Adaptive self-configuring sensor networks topologies, in Proc. of INFOCOM \u201902, New York, NY, USA, (June 2002).","DOI":"10.1109\/INFCOM.2002.1019378"},{"issue":"12","key":"3724_CR9","doi-asserted-by":"crossref","first-page":"1448","DOI":"10.1109\/TC.2002.1146711","volume":"51","author":"K. Chakrabarty","year":"December 2002","unstructured":"K. Chakrabarty, S.S. Iyengar, H. Qi and E. Cho, Grid coverage for surveillance and target location in distributed sensor networks, IEEE Transactions on Computers 51(12) (December 2002) 1448\u20131453.","journal-title":"IEEE Transactions on Computers"},{"key":"3724_CR10","doi-asserted-by":"crossref","unstructured":"B. Chen, K. Jamieson, H. Balakrishnan and R. Morris, Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks, in ACM\/IEEE International Conference on Mobile Computing and Networking (MobiCom 2001), Rome, Italy (July 2001).","DOI":"10.1145\/381677.381686"},{"key":"3724_CR11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B. Clark","year":"1990","unstructured":"B. Clark, C. Colbourn and D. Johnson, Unit Disk Graphs, Discrete Mathematics 86 (1990) 165\u2013177.","journal-title":"Discrete Mathematics"},{"key":"3724_CR12","doi-asserted-by":"crossref","unstructured":"S.S. Dhillon and K. Chakrabarty, Sensor placement for effective coverage and surveillance in distributed sensor networks, in Proc. of IEEE Wireless Communications and Networking Conference (2003) pp. 1609\u20131614.","DOI":"10.21236\/ADA445754"},{"key":"3724_CR13","doi-asserted-by":"crossref","unstructured":"D. Estrin, R. Govindan and J. Heidemann, Editors, special issue on embedding the internet, Communications of the ACM, 43 (2000).","DOI":"10.1145\/332833.332836"},{"key":"3724_CR14","unstructured":"M. Franceschetti, M. Cook and J. Bruck, A geometric theorem for approximate disk covering algorithms, Technical Report ETR035, Caltech University (January 2001)."},{"key":"3724_CR15","unstructured":"S. Funke, A. Kesselman, U. Meyer and M. Segal, A simple improved distributed algorithm for minimum cds in unit disk graphs, in IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2005), to appear."},{"issue":"1","key":"3724_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"S. Guha and S. Khuller, Improved methods for approximating node weighted steiner trees and connected dominating sets, Inf. Comput., 150(1) (1999) 57\u201374.","journal-title":"Inf. Comput."},{"key":"3724_CR17","doi-asserted-by":"crossref","unstructured":"H. Gupta, S.R. Das and Quinyi Gu, Connected sensor cover: Self-organization of sensor networks for efficient query execution, in Proc. of MobiHoc 03, Annapolis, Maryland (June 2003).","DOI":"10.1145\/778415.778438"},{"key":"3724_CR18","doi-asserted-by":"crossref","unstructured":"D.S. Hochbaum and W. Maas, Approximation schemes for covering and packing problems in image processing and vlsi, J. ACM 32 (1985) 130\u2013136.","DOI":"10.1145\/2455.214106"},{"key":"3724_CR19","unstructured":"H. Huang, A. Richa and M. Segal, Dynamic coverage and related problems in ad hoc sensor networks, ACM Mobile Networks and Applications: Special Issue on Algorithmic Solutions for Wireless, Mobile, Ad Hoc and Sensor Networks (2003)."},{"key":"3724_CR20","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974) 256\u2013278.","journal-title":"J. Comput. System Sci."},{"issue":"6","key":"3724_CR21","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1137\/0219071","volume":"19","author":"D.T. Lee","year":"1990","unstructured":"D.T. Lee, M. Sarrafzadeh and Y.F. Wu, Minimum cut for circular-arc graphs, SIAM J. Computing 19(6) (1990) 1041\u20131050.","journal-title":"SIAM J.Computing"},{"key":"3724_CR22","doi-asserted-by":"crossref","unstructured":"A. Mainwaring, J. Polastre, R. Szewczyk and D. Culler, Wireless sensor networks for habitat monitoring, in First ACM International Workshop on Wireless Workshop in Wireless Sensor Networks and Applications (August 2002).","DOI":"10.1145\/570738.570751"},{"issue":"1","key":"3724_CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0217003","volume":"17","author":"S. Masuda","year":"1988","unstructured":"S. Masuda and K. Nakajima, An optimal algorithm for finding a maximum independent set of a circular-arc graph, SIAM Journal on Computing, 17(1) (1988) 41\u201352.","journal-title":"SIAM Journal on Computing"},{"key":"3724_CR24","doi-asserted-by":"crossref","unstructured":"J. Matousek, R. Seidel and E. Welzl, How to net a lot with little: Small \u03b5-nets for disks and halfspaces, in Proc. of 6th Annu. ACM Sympos. Comput. Geom. (1990) pp. 16\u201322.","DOI":"10.1145\/98524.98530"},{"key":"3724_CR25","unstructured":"S. Meguerdichian and M. Potkonjak, Low power 0\/1 coverage and scheduling techniques in sensor networks, UCLA Technical Report 030001 (January 2003)."},{"key":"3724_CR26","doi-asserted-by":"crossref","unstructured":"S. Slijepcevic and M. Potkonjak, Power efficient organization of wireless sensor networks, in Proc. of IEEE International Conference on Communications (ICC) (2001) pp. 472\u2013476.","DOI":"10.1109\/ICC.2001.936985"},{"key":"3724_CR27","doi-asserted-by":"crossref","unstructured":"D. Tian and N.D. Georganas, A coverage-preserved node scheduling scheme for large wireless sensornetworks, in Proc. of First International Workshop on Wireless Sensor Networks and Applications, Atlanta, USA (September 2002).","DOI":"10.1145\/570738.570744"},{"key":"3724_CR28","doi-asserted-by":"crossref","unstructured":"P.J. Wan, K. Alzoubi and O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, in Proc. of INFOCOM 2002.","DOI":"10.1145\/513800.513820"},{"key":"3724_CR29","doi-asserted-by":"crossref","unstructured":"X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless and C.D. Gill, Integrated coverage and connectivity configuration in wireless sensor networks, in Proc. of SenSys \u201903.","DOI":"10.1145\/958491.958496"},{"key":"3724_CR30","doi-asserted-by":"crossref","unstructured":"Y. Xu, J. Heidemann, and D. Estrin, Geography-informed energy conservation for ad hoc routing, in ACM\/IEEE International Conference on Mobile Computing and Networking (Proc. of MobiCom 2001), Rome, Italy, (July 2001).","DOI":"10.1145\/381677.381685"},{"key":"3724_CR31","unstructured":"F. Ye, G. Zhong, S. Lu and L. Zhang, Peas: A robust energy conserving protocol for long-lived sensor networks, in Proc. of The 23nd International Conference on Distributed Computing Systems (ICDCS) (2003)."},{"key":"3724_CR32","unstructured":"H. Zhang and J.C. Hou, Maintaining sensing coverage and connectivity in large sensor networks, Technical Report UIUC (2003) UIUCDCS-R-2003\u20132351."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-006-3724-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-006-3724-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-006-3724-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:01:53Z","timestamp":1559394113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-006-3724-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,8]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["3724"],"URL":"https:\/\/doi.org\/10.1007\/s11276-006-3724-9","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,8]]}}}