{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:45:19Z","timestamp":1725489919458},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330643"},{"type":"electronic","value":"9783642330650"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33065-0_6","type":"book-chapter","created":{"date-parts":[[2012,9,3]],"date-time":"2012-09-03T17:37:18Z","timestamp":1346693838000},"page":"50-61","source":"Crossref","is-referenced-by-count":0,"title":["Solving a 2-Covered Path Problem with Variable Radii for Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Da-Ren","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiun-Chieh","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You-Shyang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Fu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"261","volume":"1","author":"K. Aardal","year":"2006","unstructured":"Aardal, K., van Hoesel, C.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for the frequency assignment problem. 4OR\u00a01, 261\u2013318 (2006)","journal-title":"4OR"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.3390\/a2031137","volume":"2","author":"M. Abellanas","year":"2009","unstructured":"Abellanas, M., Bajuelos, A.L., Matos, I.: Optimal 2-coverage of a polygonal region in a sensor network. Algorithms\u00a02, 1138\u20131154 (2009)","journal-title":"Algorithms"},{"issue":"14","key":"6_CR3","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.ipl.2009.03.016","volume":"109","author":"M. Abellanas","year":"2009","unstructured":"Abellanas, M., Bajuelos, A.L., Matos, I.: 2-Covered paths by a set of antennas with minimum power transmission range. Information Processing Letters\u00a0109(14), 868\u2013883 (2009)","journal-title":"Information Processing Letters"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Boukerche, A., Fei, X., Araujo, R.B.: An energy aware coverage-preserving scheme for wireless sensor networks. In: Proocedings of the 2nd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks, Montreal, Canada, October 13, pp. 205\u2013213 (2005)","DOI":"10.1145\/1089803.1089987"},{"key":"6_CR5","first-page":"814","volume":"203","author":"L. Chen","year":"2010","unstructured":"Chen, L., Yuan, D.: Solving a minimum-power covering problem with overlap constraint for cellular network design. European Journal of Operational Research\u00a0203, 814\u2013823 (2010)","journal-title":"European Journal of Operational Research"},{"key":"6_CR6","first-page":"41","volume":"35","author":"A. Eisenblatter","year":"2008","unstructured":"Eisenblatter, A., Geerdes, H.F., Grotschel, M.: Planning UMTS radio networks. OR\/MS Today\u00a035, 41\u201346 (2008)","journal-title":"OR\/MS Today"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Eisenblatter, A., Koch, T., Martin, A., Achterberg, T., Fugenschuh, A., Koster, A., Wegel, O., Wessaly, R.: Modelling feasible network configurations for UMTS. In: Anandalingam, G., Raghavan, S. (eds.) Telecommunications Network Design and Management. Kluwer Academic Publishers (2002)","DOI":"10.1007\/978-1-4757-3762-2_1"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal Packing and Covering in the Plane are NP-Complete. Information Processing Letter, 133\u2013138 (1981)","DOI":"10.1016\/0020-0190(81)90111-3"},{"key":"6_CR9","unstructured":"Franceschetti, M., Cook, M., Bruck, J.: A geometric theorem for approximate disk covering algorithms. Technical report, California Institute of Technology (2001)"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(91)90075-S","volume":"40","author":"T.F. Gonzalez","year":"1991","unstructured":"Gonzalez, T.F.: Covering a set of points in multidimensional space. Information Processing Letters\u00a040(4), 181\u2013188 (1991)","journal-title":"Information Processing Letters"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","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. Journal of ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"Journal of ACM"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Nawrocki, M., Aghvami, H., Dohler, M. (eds.): Understanding UMTS RadioNetwork Modelling, Planning and Automated Optimisation: Theory and Practice. Wiley (2006)","DOI":"10.1002\/0470030569"},{"key":"6_CR13","unstructured":"Xiao, B., Zhuge, Q., Zhang, Y., Sha, E.H.M.: Algorithms for disk covering problems with the most points. In: Proceedings of the IASTED International Conference on"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33065-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:54:06Z","timestamp":1620114846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33065-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330643","9783642330650"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33065-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}