{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:28:45Z","timestamp":1725586125373},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219337"},{"type":"electronic","value":"9783642219344"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21934-4_5","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T18:12:27Z","timestamp":1308334347000},"page":"44-57","source":"Crossref","is-referenced-by-count":1,"title":["Wireless Sensor Network\u2019s Lifetime Maximization Problem in Case of Given Set of Covers"],"prefix":"10.1007","author":[{"given":"Adil I.","family":"Erzin","sequence":"first","affiliation":[]},{"given":"Roman V.","family":"Plotnikov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Inanc, M., Magdon-Ismail, M., Yener, B.: Power Optimal Connectivity and Coverage in Wireless Sensor Networks. Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY (2003)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Segal, M.: Improving Lifetime of Wireless Sensor Networks. Network Protocols and Algorithms\u00a01(2) (2009) ISSN 1943-3581 2009","DOI":"10.5296\/npa.v1i2.262"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Cardei, M., Wu, J., Lu, M., Pervaiz, M.O.: Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges. In: Proceedings of the IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob., vol.\u00a03, pp. 438\u2013445 (2005)","DOI":"10.1109\/WIMOB.2005.1512935"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.3390\/s90402446","volume":"9","author":"V. Zalubovsky","year":"2009","unstructured":"Zalubovsky, V., Astrakov, S., Erzin, A., Choo, H.: Energy-efficient Area Coverage by Sensors with Adjustable Ranges. Sensors\u00a09(4), 2446\u20132460 (2009)","journal-title":"Sensors"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Berman, P., Galinescu, G., Shan, C., Zelikovsky, A.: Power efficient monitoring management in sensor networks. In: Proceedings of IEEE Wireless Communications and Networking Conference, WCNC 2004, Atlanta, USA, March 21-25, pp. 2329\u20132334 (2004)","DOI":"10.1109\/WCNC.2004.1311452"},{"key":"5_CR6","unstructured":"Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of FOCS (1997)"},{"key":"5_CR7","series-title":"A guide to the theory of NP-completeness","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A guide to the theory of NP-completeness. Freeman, New York (1979)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-60220-8_84","volume-title":"Algorithms and Data Structures","author":"P. Berman","year":"1995","unstructured":"Berman, P., Fujito, T.: Approximating independent sets in degree 3 graphs. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 449\u2013460. Springer, Heidelberg (1995)"},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01277956","volume":"5","author":"N. Alon","year":"1995","unstructured":"Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized graph products. Computational Complexity\u00a05, 60\u201375 (1995)","journal-title":"Computational Complexity"},{"key":"5_CR11","unstructured":"Berman, P. Karpinski, M.: On some tighter inapproximability results. Technical Report TR98-065, ECCC (1998)"},{"key":"5_CR12","first-page":"1192","volume":"254","author":"A. Ghouila-Houri","year":"1962","unstructured":"Ghouila-Houri, A.: Caract\u2019erisation des matrices totalement unimodulaires. Comptes Rendus Hebdomadaires des S\u2019eances de l\u2019Acad\u2019emie des Sciences\u00a0254, 1192\u20131194 (1962)","journal-title":"Comptes Rendus Hebdomadaires des S\u2019eances de l\u2019Acad\u2019emie des Sciences"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/net.3230040407","volume":"4","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: Algorithms on circular-arc graphs. Networks\u00a04, 357\u2013369 (1974)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21934-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:00:38Z","timestamp":1560286838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21934-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219337","9783642219344"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21934-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}