{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:42:15Z","timestamp":1767991335947,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030931759","type":"print"},{"value":"9783030931766","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93176-6_1","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constant-Approximation for\u00a0Prize-Collecting Min-Sensor Sweep Coverage with\u00a0Base Stations"],"prefix":"10.1007","author":[{"given":"Wei","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"issue":"08","key":"1_CR1","doi-asserted-by":"publisher","first-page":"2699","DOI":"10.1016\/j.jpdc.2014.02.009","volume":"74","author":"B Gorain","year":"2014","unstructured":"Gorain, B., Mandal, P.S.: Approximation algorithms for sweep coverage in wireless sensor networks. J. Parallel Distrib. Comput. 74(08), 2699\u20132707 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00453-020-00762-y","volume":"83","author":"S Bhowmick","year":"2021","unstructured":"Bhowmick, S., Inamdar, T., Varadarajan, K.: Fault-tolerant covering problems in metric spaces. Algorithmica 83, 413\u2013446 (2021)","journal-title":"Algorithmica"},{"key":"1_CR3","first-page":"484","volume":"2015","author":"J-N Cao","year":"2015","unstructured":"Cao, J.-N., Huang, P., Lin, F., Liu, C., Gao, J., Zhou, J.: ACO-based sweep coverage scheme in wireless sensor networks. J. Sens. 2015, 484\u2013902 (2015)","journal-title":"J. Sens."},{"issue":"05","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1850064","DOI":"10.1142\/S1793830918500647","volume":"10","author":"Q Chen","year":"2018","unstructured":"Chen, Q., Huang, X., Ran, Y.: Approximation algorithm for distance constraint sweep coverage without predetermined base stations. Discrete Math. Algorithms Appl. 10(05), 1850064 (2018)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, W., Li, M., Liu, K., Liu, Y., Li, X., Liao, X.: Sweep coverage with mobile sensors. In: 2008 IEEE International Symposium on Parallel and Distributed Processing, pp. 1\u20139 (2008)","DOI":"10.1109\/IPDPS.2008.4536245"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Du, J., Li, Y., Liu, H., Sha, K.: On sweep coverage with minimum mobile sensors. In: IEEE 16th International Conference on Parallel and Distributed Systems, pp. 283\u2013290 (2010)","DOI":"10.1109\/ICPADS.2010.109"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629518","volume":"11","author":"H Fan","year":"2014","unstructured":"Fan, H., Li, M., Sun, X., Wan, P.-J., Zhao, Y.: Barrier coverage by sensors with adjustable ranges. ACM Trans. Sens. Netw. 11, 1\u201320 (2014)","journal-title":"ACM Trans. Sens. Netw."},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Gao, X., Fan, J., Wu, F., Chen, G.: Cooperative sweep coverage problem with mobile sensors. IEEE Trans. Mob. Comput. 1 (2020). https:\/\/doi.org\/10.1109\/TMC.2020.3008348","DOI":"10.1109\/TMC.2020.3008348"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"1_CR10","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1016\/j.ipl.2015.03.011","volume":"115","author":"B Gorain","year":"2015","unstructured":"Gorain, B., Mandal, P.S.: Approximation algorithm for sweep coverage on graph. Inf. Process. Lett. 115(9), 712\u2013718 (2015)","journal-title":"Inf. Process. Lett."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.dam.2016.09.028","volume":"228","author":"B Gorain","year":"2017","unstructured":"Gorain, B., Mandal, P.S.: Solving energy issues for sweep coverage in wireless sensor networks. Discret. Appl. Math. 228, 130\u2013139 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"11","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1109\/TMC.2010.261","volume":"10","author":"M Li","year":"2011","unstructured":"Li, M., Cheng, W., Liu, K., He, Y., Li, X., Liao, X.: Sweep coverage with mobile sensors. IEEE Trans. Mob. Comput. 10(11), 1534\u20131545 (2011)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.3390\/s21041457","volume":"21","author":"D Liang","year":"2021","unstructured":"Liang, D., Shen, H.: Efficient algorithms for max-weighted point sweep coverage on lines. Sensors (Basel, Switzerland) 21(4), 1457 (2021)","journal-title":"Sensors (Basel, Switzerland)"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s10878-018-0341-3","volume":"37","author":"J Liang","year":"2018","unstructured":"Liang, J., Huang, X., Zhang, Z.: Approximation algorithms for distance constraint sweep coverage with base stations. J. Comb. Optim. 37(4), 1111\u20131125 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0341-3","journal-title":"J. Comb. Optim."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2021.02.033","volume":"864","author":"W Liang","year":"2021","unstructured":"Liang, W., Zhang, Z., Huang, X.H.: Minimum power partial multi-cover on a line. Theoret. Comput. Sci. 864, 118\u2013128 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2021.02.028","volume":"864","author":"Z Nie","year":"2021","unstructured":"Nie, Z., Hongwei, D.: An approximation algorithm for general energy restricted sweep coverage problem. Theoret. Comput. Sci. 864, 70\u201379 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10898-021-01033-y","volume":"80","author":"Y Ran","year":"2021","unstructured":"Ran, Y., Huang, X., Zhang, Z., Du, D.-Z.: Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. J. Glob. Optim. 80(3), 661\u2013677 (2021). https:\/\/doi.org\/10.1007\/s10898-021-01033-y","journal-title":"J. Glob. Optim."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Wang, C., Ma, H.: Data collection with multiple controlled mobile nodes in wireless sensor networks. In: IEEE 17th International Conference on Parallel and Distributed Systems, pp. 489\u2013496 (2011)","DOI":"10.1109\/ICPADS.2011.49"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52824-9","volume-title":"Optimal Coverage in Wireless Sensor Networks","author":"W Wu","year":"2020","unstructured":"Wu, W., Zhang, Z., Lee, W., Du, D.-Z.: Optimal Coverage in Wireless Sensor Networks. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-52824-9"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93176-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T16:37:45Z","timestamp":1726331865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}