{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:19:31Z","timestamp":1777497571115,"version":"3.51.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031207952","type":"print"},{"value":"9783031207969","type":"electronic"}],"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-3-031-20796-9_7","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"89-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Approximation Algorithm for\u00a0the\u00a0H-Prize-Collecting Power Cover Problem"],"prefix":"10.1007","author":[{"given":"Han","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Bil\u00f3, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Brodal, G.S., Leonardi, S. (eds.) Algorithms - ESA 2005, LNCS, vol. 3669, pp. 460\u2013471. Springer, Heidelberg (2005) https:\/\/doi.org\/10.1007\/11561071_42","DOI":"10.1007\/11561071_42"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Dai, H., Deng, B., Li, W., Liu, X.: A note on the minimum power partial cover problem on the plane. J. Combinat. Optim. 44(2), 1\u20139 (2022). https:\/\/doi.org\/10.1007\/s10878-022-00869-8","DOI":"10.1007\/s10878-022-00869-8"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-24592-6_11","volume-title":"Approximation and Online Algorithms","author":"A Freund","year":"2004","unstructured":"Freund, A., Rawitz, D.: Combinatorial Interpretations of Dual Fitting and Primal Fitting. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 137\u2013150. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24592-6_11"},{"key":"7_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman and Company, New York (1990)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Guo, J., Liu, W., Hou, B.: An approximation algorithm for P-prize-collecting set cover problem. J. Operat. Res. Soc. China (2021). https:\/\/doi.org\/10.1007\/s40305-021-00364-7","DOI":"10.1007\/s40305-021-00364-7"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"K$$\\ddot{o}$$nemann, J., Parekh, O., Segev, D.: A unified approach to approximating partial covering problems. Algorithmica 59(4), 489\u2013509 (2011)","DOI":"10.1007\/s00453-009-9317-0"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Li, M., Ran, Y., Zhang, Z.: A primal-dual algorithm for the minimum power partial cover problem. J. Combinat. Optim. 39, 725\u2013746 (2020)","DOI":"10.1007\/s10878-019-00513-y"},{"key":"7_CR8","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., Li, M., Zhang, Z., Huang, X.: Minimum power partial multi-cover on a line. Theoret. Comput. Sci. 864, 118\u2013128 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Liu, X., Dai, H., Li, S., Li, W.: The $$k$$-prize-collecting minimum power cover problem with submodular penalties on a plane . Sci. Sin. Inform. 52, 947\u2013959 (2022). (in Chinese). https:\/\/doi.org\/10.1360\/SSI-2021-0445","DOI":"10.1360\/SSI-2021-0445"},{"issue":"6","key":"7_CR10","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1007\/s11590-021-01724-1","volume":"15","author":"X Liu","year":"2021","unstructured":"Liu, X., Li, W.: Approximation algorithms for the multiprocessor scheduling with submodular penalties. Optim. Lett. 15(6), 2165\u20132180 (2021). https:\/\/doi.org\/10.1007\/s11590-021-01724-1","journal-title":"Optim. Lett."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Liu, X., Li, W.: Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties. J. Combinat. Optim. 44,1964\u20131976 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00568-2","DOI":"10.1007\/s10878-020-00568-2"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Liu, X., Li, W., Dai, H.: Approximation algorithms for the minimum power cover problem with submodular\/linear penalties. Theor. Comput. Sci. 923, 256\u2013270 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.05.012 (2022)","DOI":"10.1016\/j.tcs.2022.05.012"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Liu, X., Li, W., Xie, R.: A primal-dual approximation algorithm for the $$k$$-prize-collecting minimum power cover problem. Optim. Lett. 16, 2373\u20132385 (2021). https:\/\/doi.org\/10.1007\/s11590-021-01831-z","DOI":"10.1007\/s11590-021-01831-z"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Liu, X., Li, W., Yang, J.: A primal-dual approximation algorithm for the $$k$$-prize-collecting minimum vertex cover problem with submodular penalties. Front. Comput. Sci. 17 (2022). https:\/\/doi.org\/10.1007\/s11704-022-1665-9","DOI":"10.1007\/s11704-022-1665-9"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.3390\/math9161965","volume":"9","author":"X Liu","year":"2021","unstructured":"Liu, X., Li, W., Zhu, Y.: Single machine vector scheduling with general penalties. Mathematics 9, 1965 (2021)","journal-title":"Mathematics"},{"issue":"3","key":"7_CR16","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. Global Optim. 80(3), 661\u2013677 (2021). https:\/\/doi.org\/10.1007\/s10898-021-01033-y","journal-title":"J. Global Optim."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:47:29Z","timestamp":1672552049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"19","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":"76% - 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)"}}]}}