{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T12:38:25Z","timestamp":1754397505349,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":10,"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_6","type":"book-chapter","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:04:02Z","timestamp":1670601842000},"page":"96-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Approximation Algorithm for\u00a0the\u00a0Minimum Soft Capacitated Disk Multi-coverage Problem"],"prefix":"10.1007","author":[{"given":"Han","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Bandyapadhyay, S., Bhowmick, S., Inamdar, T., Varadarajan.: Capacitated covering problems in geometric spaces. Discrete Comput. Geom. 63(4), 768\u2013798(2020)","DOI":"10.1007\/s00454-019-00127-5"},{"key":"6_CR2","unstructured":"Bandyapadhyay, S.: Improved bounds for metric capacitated covering problems. arXiv preprint arXiv:2006.12454(2020)"},{"issue":"2","key":"6_CR3","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":"6_CR4","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10878-020-00567-3","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). https:\/\/doi.org\/10.1007\/s10878-020-00567-3","journal-title":"J. Comb. Optim."},{"key":"6_CR5","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. Theor. Comput. Sci. 864, 118\u2013128 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","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. Theor. Comput. Sci. 923, 256\u2013270 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR7","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"},{"issue":"6","key":"6_CR8","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":"6_CR9","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.: Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. J. Glob. Optim. 80, 661\u2013677 (2021). https:\/\/doi.org\/10.1007\/s10898-021-01033-y","journal-title":"J. Glob. Optim."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385\u2013393 (1982)","journal-title":"Combinatorica"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T02:02:52Z","timestamp":1670637772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-8152-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811981517","9789811981524"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-8152-4_6","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)"}}]}}