{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:55:36Z","timestamp":1743029736239,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811981517"},{"type":"electronic","value":"9789811981524"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-8152-4_7","type":"book-chapter","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:04:02Z","timestamp":1670601842000},"page":"105-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A 1\/2 Approximation Algorithm for\u00a0Energy-Constrained Geometric Coverage Problem"],"prefix":"10.1007","author":[{"given":"Huan","family":"Lan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,10]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Zhang, Q., Li, W., Zhang, X., et al.: A local-ratio-based power control approach for capacitated access points in mobile edge computing (2022) https:\/\/doi.org\/10.1145\/3546000.3546027","DOI":"10.1145\/3546000.3546027"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11561071_42","volume-title":"Algorithms \u2013 ESA 2005","author":"V Bil\u00f2","year":"2005","unstructured":"Bil\u00f2, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 460\u2013471. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_42"},{"key":"7_CR3","first-page":"449","volume-title":"Symposium on Computational Geometry","author":"H Alt","year":"2006","unstructured":"Alt, H., Arkin, E.M., Br\u00f6nnimann, H., et al.: Minimum-cost coverage of point sets by disks. In: Amenta, N., Cheong, O. (eds.) Symposium on Computational Geometry, pp. 449\u2013458. ACM, New York (2006)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10878-019-00513-y","volume":"39","author":"M Li","year":"2020","unstructured":"Li, M., Ran, Y., Zhang, Z.: A primal-dual algorithm for the minimum power partial cover problem. J. Comb. Optim. 39, 725\u2013746 (2020)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1007\/s10878-022-00869-8","volume":"44","author":"H Dai","year":"2022","unstructured":"Dai, H., Deng, B., Li, W., Liu, X.: A note on the minimum power partial cover problem on the plane. J. Comb. Optim. 44(2), 970\u2013978 (2022)","journal-title":"J. Comb. Optim."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-19094-0_15","volume-title":"WALCOM: Algorithms and Computation","author":"AK Abu-Affash","year":"2011","unstructured":"Abu-Affash, A.K., Carmi, P., Katz, M.J., Morgenstern, G.: Multi cover of a polygon minimizing the sum of areas. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 134\u2013145. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19094-0_15"},{"key":"7_CR7","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., et al.: Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. J. Global Optim. 80, 661\u2013677 (2021)","journal-title":"J. Global Optim."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Liu, X., Li, W., Xie, R.: A primal-dual approximation algorithm for the $$k$$-prize-collecting minimum power cover problem. Optim. Lett. 1\u201313 (2021). https:\/\/doi.org\/10.1007\/s11590-021-01831-z","DOI":"10.1007\/s11590-021-01831-z"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.tcs.2022.05.012","volume":"923","author":"X Liu","year":"2022","unstructured":"Liu, X., Li, W., Dai, H.: Approximation algorithms for the minimum power cover problem with submodular\/linear penalties. Theoret. Comput. Sci. 923, 256\u2013270 (2022)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"7_CR10","first-page":"947","volume":"52","author":"X Liu","year":"2022","unstructured":"Liu, X., Dai, H., Li, S., Li, W.: $$k$$-prize-collecting minimum power cover problem with submodular penalties on a plane. Chin. Sci.: Inf. Sci. 52(6), 947\u2013959 (2022)","journal-title":"Chin. Sci.: Inf. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jpdc.2018.10.013","volume":"124","author":"W Li","year":"2019","unstructured":"Li, W., Liu, X., Cai, X., et al.: Approximation algorithm for the energy-aware profit maximizing problem in heterogeneous computing systems. J. Parallel Distrib. Comput. 124, 70\u201377 (2019)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-031-16081-3_23","volume-title":"Algorithmic Aspects in Information and Management","author":"H Lan","year":"2022","unstructured":"Lan, H.: Energy-constrained geometric coverage problem. In: Ni, Q., Wu, W. (eds.) AAIM 2022. LNCS, vol. 13513, pp. 268\u2013277. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-16081-3_23"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47, 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"issue":"5","key":"7_CR14","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.orl.2013.06.014","volume":"41","author":"PJ de Rezende","year":"2013","unstructured":"de Rezende, P.J., Miyazawa, F.K., Sasaki, A.T.: A PTAS for the disk cover problem of geometric objects. Oper. Res. Lett. 41(5), 552\u2013555 (2013)","journal-title":"Oper. Res. Lett."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Logan, P., Haitao, W.: Algorithms for the line-constrained disk coverage and related problems. Comput. Geom. 105, 101883 (2022)","DOI":"10.1016\/j.comgeo.2022.101883"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"L Wolsey","year":"1982","unstructured":"Wolsey, L.: Maximising real-valued submodular functions: primal and dual heuristics for location problems. Math. Oper. Res. 7(3), 410\u2013425 (1982)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447386","volume":"5","author":"J Tang","year":"2021","unstructured":"Tang, J., Tang, X., Lim, A., Han, K., Li, C., Yuan, J.: Revisiting modified greedy algorithm for monotone submodular maximization with a knapsack constraint. Proc. ACM Meas. Anal. Comput. Syst. 5(1), 1\u201322 (2021)","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.orl.2021.04.006","volume":"49","author":"A Kulik","year":"2021","unstructured":"Kulik, A., Schwartz, R., Shachnai, H.: A refined analysis of submodular Greedy. Oper. Res. Lett. 49, 507\u2013514 (2021)","journal-title":"Oper. Res. Lett."},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Feldman, M., Nutov, Z., Shoham, E.: Practical budgeted submodular maximization (2020). https:\/\/doi.org\/10.48550\/arXiv.2007.04937","DOI":"10.48550\/arXiv.2007.04937"},{"key":"7_CR21","unstructured":"Yaroslavtsev, G., Zhou, S., Avdiukhin, D.: \u201cBring Your Own Greedy\u201d+ Max: near-optimal 1\/2-approximations for submodular knapsack. In: Chiappa, S., Calandra, R. (eds.) International Conference on Artificial Intelligence and Statistics, pp. 3263\u20133274. Palermo, Sicily (2020)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, H., Vorobeychik, Y.: Submodular optimization with routing constraints. In: Schuurmans, D, Wellman, M. P., (eds.) Proceedings of the 30th AAAI Conference on Artificial Intelligence, Lake Tahoe, Nevada, pp. 819\u2013826 (2016)","DOI":"10.1609\/aaai.v30i1.10066"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-27821-4_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C Chekuri","year":"2004","unstructured":"Chekuri, C., Kumar, A.: Maximum coverage problem with group budget constraints and applications. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX\/RANDOM -2004. LNCS, vol. 3122, pp. 72\u201383. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27821-4_7"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10878-016-0102-0","volume":"34","author":"B Farbstein","year":"2017","unstructured":"Farbstein, B., Levin, A.: Maximum coverage problem with group budget constraints. J. Comb. Optim. 34, 725\u2013735 (2017). https:\/\/doi.org\/10.1007\/s10878-016-0102-0","journal-title":"J. Comb. Optim."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-319-71147-8_25","volume-title":"Combinatorial Optimization and Applications","author":"L Guo","year":"2017","unstructured":"Guo, L., Li, M., Xu, D.: Approximation algorithms for maximum coverage with group budget constraints. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 362\u2013376. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_25"}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-8152-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:12:05Z","timestamp":1670602325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-8152-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811981517","9789811981524"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-8152-4_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changchun","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2022","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":"https:\/\/conf.ccf.org.cn\/TCS2022","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"13","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":"6","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":"22% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}