{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:28:05Z","timestamp":1743006485350,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046170"},{"type":"electronic","value":"9783030046187"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04618-7_6","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T20:47:58Z","timestamp":1542401278000},"page":"62-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem"],"prefix":"10.1007","author":[{"given":"Yishuo","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7345-2185","authenticated-orcid":false,"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"issue":"2","key":"6_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(2), 137\u2013144 (2001)","journal-title":"J. Algorithms"},{"issue":"6\u20137","key":"6_CR2","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.dam.2004.11.009","volume":"155","author":"P Berman","year":"2007","unstructured":"Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discret. Appl. Math. 155(6\u20137), 733\u2013749 (2007)","journal-title":"Discret. Appl. Math."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-22006-7_30","volume-title":"Automata, Languages and Programming","author":"C Chekuri","year":"2011","unstructured":"Chekuri, C., Ene, A.: Submodular cost allocation problem and applications. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 354\u2013366. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_30"},{"key":"6_CR4","unstructured":"Chekuri, C., Quanrud, K.: On approximating (sparse) covering integer programs. ArXiv:1807.11538 [cs.DS]"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: STOC 2014, pp. 624\u2013633. ACM, New York (2014)","DOI":"10.1145\/2591796.2591884"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chen, A., Harris, D.G., Srinivasan, A.: Partial resampling to approximate covering integer programs. In: Proceedings of 27th ACM-SIAM SODA, pp. 1984\u20132003 (2016)","DOI":"10.1137\/1.9781611974331.ch139"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math. 23(3), 1400\u20131415 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1c\u0306, E., Dinitz, M., Makarychev, Y.: Minimizing the union: tight approximations for small set bipartite vertex expansion. In: SODA 2017, pp. 881\u2013899. SIAM, Philadelphia (2017)","DOI":"10.1137\/1.9781611974782.56"},{"issue":"3","key":"6_CR9","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(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"6_CR10","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 program with nonnegative data. Math. Oper. Res. 7(4), 515\u2013531 (1982)","journal-title":"Math. Oper. Res."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_14","volume-title":"Integer Programming and Combinatorial Optimization IPCO 2013","author":"M Dinitz","year":"2013","unstructured":"Dinitz, M., Gupta, A.: Packing interdiction and partial covering problems. In: Goemans, M., Correa, J. (eds.) Integer Programming and Combinatorial Optimization IPCO 2013. LNCS, vol. 7801. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36694-9_14"},{"issue":"1","key":"6_CR12","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"},{"issue":"3","key":"6_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(3), 555\u2013556 (1982)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: FOCS 2009, pp. 671\u2013680. IEEE Computer Society (2009)","DOI":"10.1109\/FOCS.2009.31"},{"key":"6_CR15","first-page":"2436","volume":"26","author":"RK Iyer","year":"2013","unstructured":"Iyer, R.K., Bilmes, J.A.: Submodular optimization with submodular cover and submodular knapsack constraints. Adv. Neural Inf. Process. Syst. 26, 2436\u20132444 (2013)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"6_CR16","unstructured":"Iyer, R.K., Jegelka, S., Bilmes, J.A.: Monotone closure of relaxed constraints in submodular optimization: connections between minimization and maximization. In: Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence, pp. 360\u2013369 (2014)"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D Johnson","year":"1974","unstructured":"Johnson, D.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"issue":"10","key":"6_CR18","doi-asserted-by":"publisher","first-page":"2957","DOI":"10.1007\/s00453-017-0363-8","volume":"80","author":"N Kamiyama","year":"2018","unstructured":"Kamiyama, N.: A note on submodular function minimization with covering type linear constraints. Algorithmica 80(10), 2957\u20132971 (2018)","journal-title":"Algorithmica"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20877-5_14","volume-title":"Theory and Applications of Models of Computation","author":"N Kamiyama","year":"2011","unstructured":"Kamiyama, N.: Submodular function minimization under a submodular set covering constraint. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20877-5_14"},{"key":"6_CR20","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 (1990)"},{"issue":"3","key":"6_CR21","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."},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00453-009-9317-0","volume":"59","author":"J Konemann","year":"2011","unstructured":"Konemann, J., Parekh, O., Segev, D.: A uinifed approach to approximating partial covering problems. Algorithmica 59(4), 489\u2013509 (2011)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jcss.2005.05.002","volume":"71","author":"SG Kolliopoulos","year":"2005","unstructured":"Kolliopoulos, S.G., Young, N.E.: Approximation algorithms for covering\/packing integer programs. J. Comput. Syst. Sci. 71(4), 495\u2013505 (2005). Preliminary version in FOCS (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00453-012-9629-3","volume":"66","author":"C Koufogiannakis","year":"2013","unstructured":"Koufogiannakis, C., Young, N.: Greedy $$\\Delta $$-approximation algorithm for covering with arbitrary constraints and submodular cost. Algorithmica 66(1), 113\u2013152 (2013)","journal-title":"Algorithmica"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming The State of the Art","author":"L. Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachem, A., Korte, B., Gr\u00f6tschel, M. (eds.) Mathematical Programming the State of the Art. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/978-3-642-68874-4_10"},{"issue":"4","key":"6_CR26","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 the optimal integral and fractional covers. Discret. Math. 13(4), 383\u2013390 (1975)","journal-title":"Discret. Math."},{"key":"6_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. The Press Syndicate of the University of Cambridge, Cambridge (2005)"},{"issue":"2","key":"6_CR28","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(2), 525\u2013540 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR29","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(2), 791\u2013802 (2017)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"6_CR30","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."},{"issue":"5","key":"6_CR31","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":"3","key":"6_CR32","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1137\/S0097539703434620","volume":"36","author":"A Srinivasan","year":"2006","unstructured":"Srinivasan, A.: An extension of the Lovsz local lemma, and its applications to integer programming. SIAM J. Comput. 36(3), 609\u2013634 (2006)","journal-title":"SIAM J. Comput."},{"key":"6_CR33","unstructured":"Shi, Y., Zhang, Z., Du, D.-Z.: Randomized bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem. https:\/\/arxiv.org\/abs\/1701.05339"},{"issue":"1","key":"6_CR34","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01071394","volume":"13","author":"NZ Shor","year":"1977","unstructured":"Shor, N.Z.: Cut-off method with space extension in convex programming problems. Cybern. Syst. Anal. 13(1), 94\u201396 (1977)","journal-title":"Cybern. Syst. Anal."},{"key":"6_CR35","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., et al.: On positive influence dominating sets in social networks. Theor. Comput. Sci. 412, 265\u2013269 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"6_CR36","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(4), 385\u2013393 (1982)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:57:33Z","timestamp":1710338253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}