{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:58:42Z","timestamp":1757311122063,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901533","U20A2068"],"award-info":[{"award-number":["11901533","U20A2068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771013"],"award-info":[{"award-number":["11771013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LD19A010001"],"award-info":[{"award-number":["LD19A010001"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation of USA","doi-asserted-by":"crossref","award":["1907472"],"award-info":[{"award-number":["1907472"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11590-021-01746-9","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T12:03:47Z","timestamp":1621339427000},"page":"667-680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Approximation algorithm for minimum partial multi-cover under a geometric setting"],"prefix":"10.1007","volume":"16","author":[{"given":"Yingli","family":"Ran","sequence":"first","affiliation":[]},{"given":"Xiaohui","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,18]]},"reference":[{"key":"1746_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. J. Algorithms 39, 137\u2013144 (2001)","journal-title":"J. Algorithms"},{"key":"1746_CR2","first-page":"145","volume":"7501","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. ESA LNCS 7501, 145\u2013156 (2012)","journal-title":"ESA LNCS"},{"key":"1746_CR3","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Grant, E., K$$\\ddot{o}$$nemann, J., Sharpe, M.: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17\u201319, pp. 1576\u20131585 (2012)","DOI":"10.1137\/1.9781611973099.125"},{"issue":"5","key":"1746_CR4","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.comgeo.2014.12.005","volume":"48","author":"TM Chan","year":"2015","unstructured":"Chan, T.M., Hu, N.: Geometric red-blue set cover for unit squares and related problems. Comput. Geom. 48(5), 380\u2013385 (2015)","journal-title":"Comput. Geom."},{"key":"1746_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Clarkson, K.L., Har-Peled, S.: On the set multi-cover problem in geometric settings. ACM Trans. Algorithms 9(1), Article 9 (2012)","DOI":"10.1145\/2390176.2390185"},{"issue":"2","key":"1746_CR6","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1137\/16M1096402","volume":"32","author":"E Chlamt\u00e1\u010d","year":"2018","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M., Konrad, C., Kortsarz, G.: The densest $$k$$-subhypergraph problem. SIAM J. Discrete Math. 32(2), 1458\u20131477 (2018)","journal-title":"SIAM J. Discrete Math."},{"key":"1746_CR7","doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M., Krauthgamer, R.: Everywhere-sparse spanners via dense subgraphs. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS2012, New Brunswick, NJ, USA, pp. 758\u2013767 (212)","DOI":"10.1109\/FOCS.2012.61"},{"key":"1746_CR8","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M., Makarychev, Y.: Minimizing the union: tight approximations for small set bipartite vertex expansion. In: SODA\u201917, pp. 881\u2013899"},{"issue":"1","key":"1746_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Aravind, S.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"1746_CR10","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/173","volume-title":"Geometric Approximation Algorithms","author":"S Har-Peled","year":"2011","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms. American Mathematical Society, Providence (2011)"},{"key":"1746_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"1746_CR12","unstructured":"Inamdar, T.: Local search for geometric partial covering problems. In: CCCG2019, Edmonton, pp. Canada, 242\u2013249 (2019)"},{"key":"1746_CR13","unstructured":"Inamdar, T., Varadarajan. K.R.: On partial covering for geometric set systems. In: 34th International Symposium on Computational Geometry, pp. 47:1\u201347:14 (2018)"},{"key":"1746_CR14","doi-asserted-by":"crossref","unstructured":"Manurangsi, P.: Almost-polynomial ratio ETH-hardness of approximating densest $$k$$-subgraph. STOC2017, Montreal, PQ, Canada, June 19\u201323, pp. 954\u2013961","DOI":"10.1145\/3055399.3055412"},{"key":"1746_CR15","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"1746_CR16","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10878-016-0005-0","volume":"33","author":"Y Ran","year":"2017","unstructured":"Ran, Y., Zhang, Z., Du, H., Zhu, Y.: Approximation algorithm for partial positive influence problem in social network. J. Comb. Optim. 33, 791\u2013802 (2017)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1746_CR17","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s10878-016-0066-0","volume":"34","author":"Y Ran","year":"2017","unstructured":"Ran, Y., Shi, Y., Zhang, Z.: Local ratio method on partial set multi-cover. J. Comb. Optim. 34(1), 302\u2013313 (2017)","journal-title":"J. Comb. Optim."},{"key":"1746_CR18","doi-asserted-by":"crossref","unstructured":"Ran, Y., Shi, Y., Tang, C., Zhang, Z.: A primal-dual algorithm for the minimum partial set multi-cover problem. J. Comb. Optim. 39(3), 725\u2013746 (2020). A preliminary version appeared in COCOA\u201918, Atlanta, GA, USA, December 15\u201317, LNCS, vol. 11346, pp. 372\u2013385","DOI":"10.1007\/s10878-019-00513-y"},{"key":"1746_CR19","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.0975","author":"Y Ran","year":"2020","unstructured":"Ran, Y., Zhang, Z., Tang, S., Du, D.-Z.: Breaking the $$r_{\\max }$$ barrier: enhanced approximation algorithms for partial set multi-cover problem. Informs J. Comput. (2020). https:\/\/doi.org\/10.1287\/ijoc.2020.0975","journal-title":"Informs J. Comput."},{"key":"1746_CR20","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1007\/s10898-019-00804-y","volume":"75","author":"Y Shi","year":"2019","unstructured":"Shi, Y., Ran, Y., Zhang, Z., Willson, J., Tong, G., Du, D.-Z.: Approximation algorithm for the partial set multi-cover problem. J. Glob. Optim. 75, 1133\u20131146 (2019)","journal-title":"J. Glob. Optim."},{"key":"1746_CR21","doi-asserted-by":"crossref","unstructured":"Shi, Y., Ran, Y., Zhang, Z., Du, D.-Z.: A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem. Theor. Comput. Sci. 803, 1\u20139 (2020). A preliminary version appeared in AAIM2018, Dallas, TX, USA, December 3\u20134, LNCS, vol. 11343, pp. 62\u201373","DOI":"10.1016\/j.tcs.2019.03.004"},{"key":"1746_CR22","doi-asserted-by":"crossref","unstructured":"Wang, F., Camacho, E., Xu, K.: Positive influence dominating set in online social networks. In: COCOA\u201909, LNCS, vol. 5573, pp. 313\u2013321 (2009)","DOI":"10.1007\/978-3-642-02026-1_29"},{"key":"1746_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2009.10.001","volume":"412","author":"F Wang","year":"2011","unstructured":"Wang, F., Du, H., Camacho, E., Xu, K., Lee, W., Shi, Y., Shan, S.: On positive influence dominating sets in social networks. Theor. Comput. Sci. 412, 265\u2013269 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1746_CR24","unstructured":"Zhang, Z., Shi, Y., Willson, J., Du, D.-Z., Tong, G.: Viral marketing with positive influence. In: INFOCOM2017, Atlanta, GA, USA, May 1\u20134, pp. 1\u20138"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01746-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01746-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01746-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T13:28:00Z","timestamp":1645018080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01746-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,18]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1746"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01746-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,5,18]]},"assertion":[{"value":"2 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}