{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T02:33:38Z","timestamp":1774406018364,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819642069","type":"print"},{"value":"9789819642076","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-4207-6_48","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:04:27Z","timestamp":1743620667000},"page":"534-540","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Streaming Algorithm for\u00a0Balance Gain and\u00a0Cost with\u00a0Knapsack Constraint on\u00a0the\u00a0Integer Lattice"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9941-0629","authenticated-orcid":false,"given":"Jingjing","family":"Tan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0737-1915","authenticated-orcid":false,"given":"Meixia","family":"Li","sequence":"additional","affiliation":[]},{"given":"Meng","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Ruiqi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos,A., Becchetti, L., Castillo, C., Gionis, A., Leonardi, S.: Online team formation in social networks. In: Proceedings of the 21st International Conference on World Wide Web, pp. 839\u2013848 (2012)","DOI":"10.1145\/2187836.2187950"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Castillo, C., Fazzone, A., Leonardi, S., Terzi, E.: Algorithms for hiring and outsourcing in the online labor market. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1109\u20131118 (2018)","DOI":"10.1145\/3219819.3220056"},{"key":"48_CR3","unstructured":"Bai, W., Bilmes, J.: Greed is still good: maximizing monotone submodular+ supermodular (BP) functions. In: International Conference on Machine Learning, pp. 304\u2013313 (2018)"},{"key":"48_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.dam.2015.01.026","volume":"186","author":"KM Byrnes","year":"2015","unstructured":"Byrnes, K.M.: A tight analysis of the submodular-supermodular procedure. Discrete Appl. Math. 186, 275\u2013282 (2015)","journal-title":"Discrete Appl. Math."},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 467\u2013476 (2009)","DOI":"10.1145\/1557019.1557074"},{"key":"48_CR6","doi-asserted-by":"crossref","first-page":"2946","DOI":"10.1007\/s10878-021-00827-w","volume":"44","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Xu, D., Du, D., Jiang, Y.: Bicriteria streaming algorithms to balance gain and cost with cardinality constraint. J. Comb. Optim. 44, 2946\u20132962 (2022)","journal-title":"J. Comb. Optim."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Nikolakaki, S., Ene, A, Terzi, E.: An efficient framework for balancing submodularity and cost. ArXiv preprint arXiv: 2002.07782 (2021)","DOI":"10.1145\/3447548.3467367"},{"key":"48_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s40305-014-0053-z","volume":"2","author":"D Du","year":"2014","unstructured":"Du, D., Li, Y., Xiu, N., Xu, D.: Simultaneous approximation of multi-criteria submodular functions maximization. J. Oper. Res. Soc. China 2, 271\u2013290 (2014)","journal-title":"J. Oper. Res. Soc. China"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M.: Guess free maximization of submodular and linear sums. In: Proceedings of the 16th International Conference Workshop on Algorithms and Data Structures, pp 380\u2013394 (2019)","DOI":"10.1007\/978-3-030-24766-9_28"},{"issue":"1","key":"48_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lovasz","year":"1979","unstructured":"Lovasz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10107-018-1324-y","volume":"172","author":"T Soma","year":"2018","unstructured":"Soma, T., Yoshida, Y.: Maximization monotone submodular functions over the integer lattice. Math. Program. 172, 539\u2013563 (2018)","journal-title":"Math. Program."},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Sviridenko, M., Vondr, J., Ward, J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. In: Proceedings of SODA, pp. 1134\u20131148 (2015)","DOI":"10.1137\/1.9781611973730.76"},{"key":"48_CR13","doi-asserted-by":"crossref","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\u20136 (2019)","journal-title":"Oper. Res. Lett."},{"key":"48_CR14","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., Singh, A., Guestrin, C.: Near-optimal sensor placements in gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9, 235\u2013284 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"48_CR15","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"L Wolsey","year":"1982","unstructured":"Wolsey, L.: Maximising real-valued submodular set function: primal and dual heuristics for location problems. Math. Oper. Res. 7, 410\u2013425 (1982)","journal-title":"Math. Oper. Res."},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Post, I., Vondr$$\\acute{\\rm {a}}$$k, J.: Online submodular welfare maximization: Greedy is optimal. In: Proceedings of SODA, pp. 1216\u20131225 (2012)","DOI":"10.1137\/1.9781611973105.88"},{"key":"48_CR17","unstructured":"Soma, T., Kakimura, N., Inaba, K., Kawarabayashi, K.: Optimal budget allocation: theoretical guarantee and efficient algorithm. In: Proceedings of ICML, pp. 351\u2013359 (2014)"},{"key":"48_CR18","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of ICML, pp. 1057\u20131064 (2011)"},{"key":"48_CR19","doi-asserted-by":"crossref","unstructured":"Gottschalk, C., Peis, B.: Submodualr function maximization on the bounded integer lattice. In: Proceedings of WAOA, pp. 133\u2013144 (2015)","DOI":"10.1007\/978-3-319-28684-6_12"},{"issue":"4","key":"48_CR20","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.1007\/s10878-020-00558-4","volume":"39","author":"Q Nong","year":"2020","unstructured":"Nong, Q., Fang, J., Gong, S., Du, D., Feng, Y., Qu, X.: A 1\/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice. J. Comb. Optim. 39(4), 1208\u20131220 (2020)","journal-title":"J. Comb. Optim."},{"key":"48_CR21","unstructured":"Soma, T., Kakimura, N., Inaba, K., Kawarabayashi, K.: Optimal budget allocation: theoretical guarantee and efficient algorithm. In: Proceedings of ICML, pp. 351\u2013359 (2014)"},{"issue":"2","key":"48_CR22","first-page":"1","volume":"45","author":"J Tan","year":"2023","unstructured":"Tan, J., Xu, Y., Zhang, D., Zhang, X.: On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice. J. Combin. Optim. 45(2), 1\u201319 (2023)","journal-title":"J. Combin. Optim."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4207-6_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:05:03Z","timestamp":1743620703000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4207-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819642069","9789819642076"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4207-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpcc.siat.ac.cn\/meeting\/pdcat2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}