{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T11:41:45Z","timestamp":1742643705214,"version":"3.40.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,4]],"date-time":"2012-03-04T00:00:00Z","timestamp":1330819200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10898-012-9871-x","type":"journal-article","created":{"date-parts":[[2012,3,5]],"date-time":"2012-03-05T19:44:58Z","timestamp":1330976698000},"page":"559-568","source":"Crossref","is-referenced-by-count":26,"title":["Maximum lifetime connected coverage with two active-phase sensors"],"prefix":"10.1007","volume":"56","author":[{"given":"Hongwei","family":"Du","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,4]]},"reference":[{"key":"9871_CR1","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006), LNCS 4110, Springer, pp. 3\u201314 (2006)","DOI":"10.1007\/11830924_3"},{"key":"9871_CR2","doi-asserted-by":"crossref","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. In: Proceedings of the FOCS, pp. 265\u2013273 (1983)","DOI":"10.1109\/SFCS.1983.7"},{"volume-title":"Sensors: Theory, Algorithms, and Applications","year":"2012","key":"9871_CR3","unstructured":"Boginski, V.L., Commander, C.W., Pardalos, P.M., Ye, Y. (eds): Sensors: Theory, Algorithms, and Applications. Springer, Berlin (2012)"},{"key":"9871_CR4","first-page":"142","volume-title":"Design and Analysis of Approximation Algorithms","author":"D.-Z. Du","year":"2012","unstructured":"Du D.-Z., Ko K.-I., Hu X.: Design and Analysis of Approximation Algorithms, pp. 142\u2013157. Springer, Berlin (2012)"},{"key":"9871_CR5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10878-010-9358-y","volume":"23","author":"H. Du","year":"2012","unstructured":"Du H., Wu W., Shan S., Kim D., Lee W.: Constructing weakly connected dominating set for secure clustering in distributed sensor network. J. Comb. Optim. 23, 301\u2013307 (2012)","journal-title":"J. Comb. Optim."},{"key":"9871_CR6","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Mihalk, M.: A $${(4 + \\epsilon)}$$ -approximation for the minimum-weight dominating set problem in unit disk graphs. WAOA, pp. 135\u2013146 (2009)","DOI":"10.1007\/978-3-642-12450-1_13"},{"key":"9871_CR7","doi-asserted-by":"crossref","unstructured":"Garg, N., K\u00f6nemann, J.: Faster and simpler algorithms for multicommodity flows and other fractional packing problems. In: Proceedings of the 39th Annual Symposium on the Foundations of Computer Science, pp. 300\u2013309 (1998)","DOI":"10.1109\/SFCS.1998.743463"},{"key":"9871_CR8","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum D.S., Maass W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"9871_CR9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/s10878-008-9146-0","volume":"18","author":"Y. Huang","year":"2009","unstructured":"Huang Y., Gao X., Zhang Z., Wu W.: A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim. 18, 174\u2013194 (2009)","journal-title":"J. Comb. Optim."},{"key":"9871_CR10","doi-asserted-by":"crossref","first-page":"565","DOI":"10.3390\/a2010565","volume":"2","author":"A. Sorokin","year":"2009","unstructured":"Sorokin A., Boyko N., Boginski V., Uryasev S., Pardalos P.: Mathematical programming techniques for sensor networks. Algorithms 2, 565\u2013581 (2009)","journal-title":"Algorithms"},{"key":"9871_CR11","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/s10878-008-9173-x","volume":"19","author":"C. Wang","year":"2010","unstructured":"Wang C., Willson J., Park M.A., Farago A., Wu W.: On dual power assignment optimization for biconnectivity. J. Comb. Optim. 19, 174\u2013183 (2010)","journal-title":"J. Comb. Optim."},{"key":"9871_CR12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11590-009-0151-8","volume":"4","author":"W. Wu","year":"2010","unstructured":"Wu W., Gao X., Pardalos P.M., Du D.-Z.: Wireless networking, dominating and packing. Optim. Lett. 4, 347\u2013358 (2010)","journal-title":"Optim. Lett."},{"issue":"3","key":"9871_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s11590-009-0155-4","volume":"4","author":"Y. Yang","year":"2010","unstructured":"Yang Y., Cardei M.: Adaptive energy efficient sensor scheduling for wireless sensor networks. Optim. lett. 4(3), 359\u2013369 (2010)","journal-title":"Optim. lett."},{"key":"9871_CR14","first-page":"89","volume":"1","author":"H. Zhang","year":"2005","unstructured":"Zhang H., Hou J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc Sens. Wirel. Netw. 1, 89\u2013124 (2005)","journal-title":"Ad Hoc Sens. Wirel. Netw."},{"key":"9871_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Li, W.: Modeling and energy consumption evaluation of a stochastic wireless sensor networks. (2011, preprint)","DOI":"10.1186\/1687-1499-2012-282"},{"key":"9871_CR16","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/s10878-009-9229-6","volume":"18","author":"F. Zou","year":"2009","unstructured":"Zou F., Li X., Gao S., Wu W.: Node-weighted Steiner tree approximation in unit disk graphs. J. Comb. Optim. 18, 342\u2013349 (2009)","journal-title":"J. Comb. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9871-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9871-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9871-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T11:27:13Z","timestamp":1742642833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9871-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9871"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9871-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2012,3,4]]}}}