{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T15:15:49Z","timestamp":1772637349581,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T00:00:00Z","timestamp":1562112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T00:00:00Z","timestamp":1562112000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531011"],"award-info":[{"award-number":["11531011"]}],"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":["61751303"],"award-info":[{"award-number":["61751303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LD19A010001"],"award-info":[{"award-number":["LD19A010001"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LA19A010018"],"award-info":[{"award-number":["LA19A010018"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10898-019-00804-y","type":"journal-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:02:53Z","timestamp":1562158973000},"page":"1133-1146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Approximation algorithm for the partial set multi-cover problem"],"prefix":"10.1007","volume":"75","author":[{"given":"Yishuo","family":"Shi","sequence":"first","affiliation":[]},{"given":"Yingli","family":"Ran","sequence":"additional","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"James","family":"Willson","sequence":"additional","affiliation":[]},{"given":"Guangmo","family":"Tong","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,3]]},"reference":[{"key":"804_CR1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"2003","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (2003)"},{"key":"804_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R Bar-Yuhuda","year":"2001","unstructured":"Bar-Yuhuda, R.: Using homogeneous weights for approximating the partial cover problem. J. Algorithms 39, 137\u2013144 (2001)","journal-title":"J. Algorithms"},{"key":"804_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0304-0208(08)73101-3","volume":"109","author":"R Bar-Yuhuda","year":"1985","unstructured":"Bar-Yuhuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. N.-Holl. Math. Stud. 109, 27\u201345 (1985)","journal-title":"N.-Holl. Math. Stud."},{"key":"804_CR4","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings 12th ACM-SIAM Symposium Discrete Algorithms, pp. 642\u2013651 (2001)"},{"key":"804_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-32512-0_9","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Chandra Chekuri","year":"2012","unstructured":"Chekuri, C., Ene, A., Vakilian, A.: Prize-collecting survivable network design in node-weighted graphs. In: APPROX\/RANDOM LNCS, vol. 7408, pp. 98\u2013109 (2012)"},{"issue":"2","key":"804_CR6","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/1921659.1921664","volume":"7","author":"C Chekuri","year":"2011","unstructured":"Chekuri, C., Even, G., Gupta, A., Segev, D.: Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms 7(2), 18:1\u201318:7 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"804_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4, 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"804_CR8","first-page":"624","volume":"2014","author":"I Dinur","year":"2014","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. STOC 2014, 624\u2013633 (2014)","journal-title":"STOC"},{"key":"804_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/moor.7.4.515","volume":"7","author":"G Dobson","year":"1982","unstructured":"Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with nonnegatice data. Math. Oper. Res. 7, 515\u2013531 (1982)","journal-title":"Math. Oper. Res."},{"key":"804_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. In: Proceedings 28th ACM Symposium on the Theory of Computing, pp. 312\u2013318 (1996)","DOI":"10.1145\/237814.237977"},{"issue":"1","key":"804_CR11","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., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"804_CR12","first-page":"71","volume":"2010","author":"M Hajiaghayi","year":"2010","unstructured":"Hajiaghayi, M., Khandekar, R., Kortsarz, G., Nutov, Z.: Prize-collecting Steiner network problems. IPCO 2010, 71\u201384 (2010)","journal-title":"IPCO"},{"key":"804_CR13","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11, 555\u2013556 (1982)","journal-title":"SIAM J. Comput."},{"key":"804_CR14","volume-title":"Linear Programming","author":"JP Ignizio","year":"1994","unstructured":"Ignizio, J.P., Cavalier, T.M.: Linear Programming. Prentice-Hall, Inc., Upper Saddle River (1994)"},{"key":"804_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst Sci."},{"key":"804_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"804_CR17","volume-title":"The Computational Complexity of Machine Learning","author":"M Kearns","year":"1990","unstructured":"Kearns, M.: The Computational Complexity of Machine Learning. MIT Press, Cambridge, MA (1990)"},{"issue":"3","key":"804_CR18","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within $$2-\\varepsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"804_CR19","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00453-009-9317-0","volume":"59","author":"J K\u00f6nemann","year":"2011","unstructured":"K\u00f6nemann, J., Parekh, O., Segev, D.: A uinifed approach to approximating partial covering problems. Algorithmica 59, 489\u2013509 (2011)","journal-title":"Algorithmica"},{"key":"804_CR20","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"804_CR21","doi-asserted-by":"crossref","unstructured":"Manurangsi, P.: Almost-polynomial ratio ETH-hardness of approximating densest $$k$$-subgraph. In: STOC, pp. 19\u201323 (2017)","DOI":"10.1145\/3055399.3055412"},{"issue":"7","key":"804_CR22","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1137\/080729645","volume":"39","author":"Z Nutov","year":"2010","unstructured":"Nutov, Z.: Approximating Steiner networks with node weights. SIAM J. Comput. 39(7), 3001\u20133022 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"804_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2390176.2390177","volume":"9","author":"Z Nutov","year":"2012","unstructured":"Nutov, Z.: Approximating minimum-cost connectivity problems via uncrossable bifamilies. ACM Trans. Algorithms 9(1), 1 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"804_CR24","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/S0097539793260763","volume":"28","author":"S Rajagopalan","year":"1998","unstructured":"Rajagopalan, S., Vazirani, V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28, 525\u2013540 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"804_CR25","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. Combin. Optim. 33(2), 791\u2013802 (2017)","journal-title":"J. Combin. Optim."},{"issue":"1","key":"804_CR26","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. Combin. Optim. 34(1), 302\u2013313 (2017)","journal-title":"J. Combin. Optim."},{"key":"804_CR27","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-030-04651-4_25","volume-title":"Combinatorial Optimization and Applications","author":"Yingli Ran","year":"2018","unstructured":"Ran, Y., Shi, Y., Zhang, Z.: Primal dual algorithm for partial set multi-cover. In: COCOA 2018, LNCS, vol. 11346, 372\u2013385 (2018)"},{"issue":"5","key":"804_CR28","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(97)00182-8","volume":"64","author":"P Slav\u00edk","year":"1997","unstructured":"Slav\u00edk, P.: Improved performance of the greedy algorithm for partial cover. Inf. Process. Lett. 64(5), 251\u2013254 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"804_CR29","doi-asserted-by":"publisher","first-page":"3620","DOI":"10.1109\/TNET.2016.2531688","volume":"24","author":"Z Zhang","year":"2016","unstructured":"Zhang, Z., Willson, J., Lu, Z., Wu, W., Zhu, X., Du, D.-Z.: Approximating maximum lifetime $$k$$-coverage through minimizing weighted $$k$$-cover in homogeneous wireless sensor networks. IEEE\/ACM Trans. Netw. 24(6), 3620\u20133633 (2016)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00804-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00804-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00804-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T23:35:35Z","timestamp":1593646535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00804-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,3]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["804"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00804-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,3]]},"assertion":[{"value":"3 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}