{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:09:23Z","timestamp":1742954963071,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93176-6_14","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"159-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8958-3999","authenticated-orcid":false,"given":"Bin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zihan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Hongmin W.","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 671\u2013680. Association for Computing Machinery, New York (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Schwartz, R.: Online submodular maximization with preemption. In: 26th ACM-SIAM Symposium on Discrete Algorithms, pp. 1202\u20131216. Society for Industrial and Applied Mathematics, Cambridge (2014)","DOI":"10.1137\/1.9781611973730.80"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. Association for Computing Machinery, Washington (2003)","DOI":"10.1145\/956750.956769"},{"issue":"5","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447396","volume":"15","author":"J Guo","year":"2021","unstructured":"Guo, J., Wu, W.: Adaptive influence maximization: if influential node unwilling to be the seed. ACM Trans. Knowl. Discov. Data 15(5), 1\u201323 (2021)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1109\/TCSS.2021.3061452","volume":"8","author":"J Guo","year":"2021","unstructured":"Guo, J., Wu, W.: Continuous profit maximization: a study of unconstrained Dr-submodular maximization. IEEE Trans. Comput. Soc. Syst. 8(3), 768\u2013779 (2021)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s00453-020-00786-4","volume":"83","author":"C Huang","year":"2021","unstructured":"Huang, C., Kakimura, N.: Improved streaming algorithms for maximising monotone submodular functions under a knapsack constraint. Algorithmica 83(3), 879\u2013902 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00786-4","journal-title":"Algorithmica"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Post, I., Vond$$\\acute{r}$$ak, J.: Online submodular welfare maximization: greedy is optimal. In: 24th ACM-SIAM Symposium on Discrete Algorithms, pp. 1216\u20131225. Society for Industrial and Applied Mathematics, New Orleans (2013)","DOI":"10.1137\/1.9781611973105.88"},{"key":"14_CR8","unstructured":"Kazemi, E., Mitrovic, M., Zadimoghaddam, M., Lattanzi, S., Karbasi, A.: Submodular streaming in all its glory: Tight approximation, minimum memory and low adaptive complexity. In: 36th International Conference on Machine Learning, pp. 3311\u20133320. International Machine Learning Society, Long Beach (2019)"},{"issue":"6","key":"14_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":"14_CR10","unstructured":"Norouzi-Fard, A., Tarnawski, J., Mitrovic, S., Zandieh, A., Mousavifar, A., Svensson, O.: Beyond 1\/2-approximation for submodular maximization on massive data streams. In: 35th International Conference on Machine Learning, pp. 3829\u20133838. International Machine Learning Society, Stockholm (2018)"},{"key":"14_CR11","unstructured":"Soma, T., Kakimura, N., Inaba, K., Kawarabayashi, K.-I.: Optimal budget allocation: theoretical guarantee and efficient algorithm. In: 31th International Conference on Machine Learning, pp. 351\u2013359. International Machine Learning Society, Beijing (2014)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-018-1324-y","volume":"172","author":"T Soma","year":"2018","unstructured":"Soma, T., Yoshida, Y.: Maximizing monotone submodular functions over the integer lattice. Math. Program. 172(1), 539\u2013563 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1324-y","journal-title":"Math. Program."},{"issue":"7","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1109\/TKDE.2018.2854182","volume":"31","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Li, Y., Tan, K.L.: Efficient representative subset selection over sliding windows. IEEE Trans. Knowl. Data Eng. 31(7), 1327\u20131340 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","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(3), 410\u2013425 (1982)","journal-title":"Math. Oper. Res."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"53736","DOI":"10.1109\/ACCESS.2018.2871668","volume":"6","author":"Q Yu","year":"2018","unstructured":"Yu, Q., Xu, L., Cui, S.: Streaming algorithms for news and scientific literature recommendation: monotone submodular maximization with a d-Knapsack constraint. IEEE Access 6, 53736\u201353747 (2018)","journal-title":"IEEE Access"}],"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-93176-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:45:36Z","timestamp":1641015936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}