{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:35:15Z","timestamp":1767321315530,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819548385","type":"print"},{"value":"9789819548392","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-4839-2_25","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:33:29Z","timestamp":1767321209000},"page":"317-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modified Greedy Algorithm for\u00a0Monotone Submodular Maximization with\u00a0Knapsack and\u00a0Partition Matroid Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6690-8796","authenticated-orcid":false,"given":"Dongkai","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8593-0383","authenticated-orcid":false,"given":"Zhongzheng","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Ageev, A.A., Sviridenko, M.I.: An 0.828-approximation algorithm for the uncapacitated facility location problem. Discret. Appl. Math. 93(2-3), 149\u2013156 (1999)","DOI":"10.1016\/S0166-218X(99)00103-1"},{"key":"25_CR2","unstructured":"Delong, A., Veksler, O., Osokin, A., Boykov, Y.: Minimizing sparse high-order energies by submodular vertex-cover. In: Advances in Neural Information Processing System, vol. 25 (2012)"},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\ln n$$ for approximating set cover. J. ACM (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J. ACM (JACM)"},{"issue":"5","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1007\/s00453-022-01071-2","volume":"85","author":"M Feldman","year":"2023","unstructured":"Feldman, M., Nutov, Z., Shoham, E.: Practical budgeted submodular maximization. Algorithmica 85(5), 1332\u20131371 (2023)","journal-title":"Algorithmica"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An Analysis of Approximations for Maximizing Submodular Set Functions\u2014II. Springer, Cham (1978)","DOI":"10.1007\/BFb0121195"},{"key":"25_CR6","unstructured":"Kazemi, E., et\u00a0al.: Data summarization with privacy and fairness constraints. In: Proceedings of the 35th International Conference on Machine Learning, pp. 1\u201310 (2018)"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1287\/opre.43.4.684","volume":"43","author":"CW Ko","year":"1995","unstructured":"Ko, C.W., Lee, J., Queyranne, M.: An exact algorithm for maximum entropy sampling. Oper. Res. 43(4), 684\u2013691 (1995)","journal-title":"Oper. Res."},{"issue":"6","key":"25_CR9","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1061\/(ASCE)0733-9496(2008)134:6(516)","volume":"134","author":"A Krause","year":"2008","unstructured":"Krause, A., Leskovec, J., Guestrin, C., VanBriesen, J., Faloutsos, C.: Efficient sensor placement optimization for securing large water distribution networks. J. Water Resour. Plan. Manag. 134(6), 516\u2013526 (2008)","journal-title":"J. Water Resour. Plan. Manag."},{"key":"25_CR10","unstructured":"Mitrovic, M., Kazemi, E., Zadimoghaddam, M., Karbasi, A.: Data summarization at scale: a two-stage submodular approach. In: International Conference on Machine Learning, pp. 3596\u20133605. PMLR (2018)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2013I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2018.11.002","volume":"47","author":"KK Sarpatwar","year":"2019","unstructured":"Sarpatwar, K.K., Schieber, B., Shachnai, H.: Constrained submodular maximization via greedy local search. Oper. Res. Lett. 47(1), 1\u20136 (2019)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/02664768700000020","volume":"14","author":"MC Shewry","year":"1987","unstructured":"Shewry, M.C., Wynn, H.P.: Maximum entropy sampling. J. Appl. Stat. 14(2), 165\u2013170 (1987)","journal-title":"J. Appl. Stat."},{"issue":"8","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1109\/JSAC.2011.110903","volume":"29","author":"K Son","year":"2011","unstructured":"Son, K., Kim, H., Yi, Y., Krishnamachari, B.: Base station operation and user association mechanisms for energy-delay tradeoffs in green cellular networks. IEEE J. Sel. Areas Commun. 29(8), 1525\u20131536 (2011)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447386","volume":"5","author":"J Tang","year":"2021","unstructured":"Tang, J., Tang, X., Lim, A., Han, K., Li, C., Yuan, J.: Revisiting modified greedy algorithm for monotone submodular maximization with a knapsack constraint. Proc. ACM Measur. Anal. Comput. Syst. 5(1), 1\u201322 (2021)","journal-title":"Proc. ACM Measur. Anal. Comput. Syst."},{"key":"25_CR17","unstructured":"Wei, K., Iyer, R., Bilmes, J.: Submodularity in data subset selection and active learning. In: International Conference on Machine Learning, pp. 1954\u20131963. PMLR (2015)"},{"issue":"3","key":"25_CR18","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"LA Wolsey","year":"1982","unstructured":"Wolsey, L.A.: Maximising real-valued submodular functions: primal and dual heuristics for location problems. Math. Oper. Res. 7(3), 410\u2013425 (1982)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4839-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:33:30Z","timestamp":1767321210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4839-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819548385","9789819548392"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4839-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.maths.sdnu.edu.cn\/TAMC2025.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}