{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T18:10:21Z","timestamp":1770142221163,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031221040","type":"print"},{"value":"9783031221057","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-22105-7_27","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"305-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Bound Coverage Problem by\u00a0Aligned Disks in\u00a0$$L_1$$ Metric"],"prefix":"10.1007","author":[{"given":"Xiaofei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhonghao","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H., et al.: Minimum-cost coverage of point sets by disks. In: Annual Symposium on Computational Geometry, pp. 449\u2013458. Association for Computing Machinery, New York, NY, USA (2006)","DOI":"10.1145\/1137856.1137922"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00549-5","volume":"44","author":"T Araki","year":"2020","unstructured":"Araki, T., Nakano, S.: Max\u2013min dispersion on a line. J. Comb. Optim. 44, 1\u20137 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00549-5","journal-title":"J. Comb. Optim."},{"key":"27_CR3","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":"27_CR4","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, 970\u2013978 (2022). https:\/\/doi.org\/10.1007\/s10878-022-00869-8","journal-title":"J. Comb. Optim."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Dai, H., Li, W., Liu, X.: An approximation algorithm for the $$h$$-prize-collecting power cover problem. In: International Computing and Combinatorics Conference. Accepted (2022)","DOI":"10.1007\/978-3-031-20796-9_7"},{"key":"27_CR6","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":"27_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman and Company, USA (1979)"},{"issue":"4","key":"27_CR8","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(4), 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"key":"27_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-020-00567-3","author":"M Li","year":"2022","unstructured":"Li, M., Ran, Y., Zhang, Z.: A primal-dual algorithm for the minimum power partial cover problem. J. Comb. Optim. (2022). https:\/\/doi.org\/10.1007\/s10878-020-00567-3","journal-title":"J. Comb. Optim."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1051\/ro\/2015010","volume":"50","author":"W Li","year":"2015","unstructured":"Li, W., Li, J., Guan, L., Shi, Y.: The prize-collecting call control problem on weighted lines and rings. RAIRO-Oper. Res. 50, 39\u201346 (2015)","journal-title":"RAIRO-Oper. Res."},{"key":"27_CR11","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."},{"issue":"6","key":"27_CR12","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1360\/SSI-2021-0445","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 (In Chinese). Sci. Sinica Inf. 52(6), 947\u2013959 (2022)","journal-title":"Sci. Sinica Inf."},{"key":"27_CR13","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."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s11590-021-01831-z","volume":"16","author":"X Liu","year":"2022","unstructured":"Liu, X., Li, W., Xie, R.: A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem. Opt. Lett. 16, 2373\u20132385 (2022)","journal-title":"Opt. Lett."},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-89543-3_19","volume-title":"Computing and Combinatorics","author":"S Nakano","year":"2021","unstructured":"Nakano, S.: The coverage problem by aligned disks. In: Chen, C.-Y., Hon, W.-K., Hung, L.-J., Lee, C.-W. (eds.) COCOON 2021. LNCS, vol. 13025, pp. 221\u2013230. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89543-3_19"},{"key":"27_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.: Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. J. Global Optim. 80, 661\u2013677 (2021). https:\/\/doi.org\/10.1007\/s10898-021-01033-y","journal-title":"J. Global Optim."},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"SK Sahni","year":"1976","unstructured":"Sahni, S.K.: Algorithms for scheduling independent tasks. J. ACM 23(1), 116\u2013127 (1976)","journal-title":"J. ACM"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-030-92681-6_35","volume-title":"Combinatorial Optimization and Applications","author":"M Xiao","year":"2021","unstructured":"Xiao, M., Zhao, S., Li, W., Yang, J.: Online bottleneck semi-matching. In: Du, D.-Z., Du, D., Wu, C., Xu, D. (eds.) COCOA 2021. LNCS, vol. 13135, pp. 445\u2013455. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92681-6_35"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:05:21Z","timestamp":1680213921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_27","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":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}