{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:46:10Z","timestamp":1743007570839,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914332"},{"type":"electronic","value":"9783030914349"}],"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-91434-9_1","type":"book-chapter","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T07:04:42Z","timestamp":1638515082000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Streaming Algorithms for Maximizing Non-submodular Functions on the Integer Lattice"],"prefix":"10.1007","author":[{"given":"Bin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zihan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Huijuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,4]]},"reference":[{"issue":"6","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M-X Goemans","year":"1995","unstructured":"Goemans, M.-X., Williamson, D.-P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"1_CR2","unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: 49th Annual Meeting of the Association for Computational Linguistics, Portland, Oregon, pp. 510\u2013520. Association for Computational Linguistics (2011)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Sipos, R., Swaminathan, A., Shivaswamy, P., Joachims, T.: Temporal corpus summarization using submodular word coverage. In: 21st ACM International Conference on Information and Knowledge Management, Maui, HI, USA, pp. 754\u2013763. Association for Computing Machinery (2012)","DOI":"10.1145\/2396761.2396857"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-72792-7_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Calinescu","year":"2007","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a submodular set function subject to a matroid constraint (extended abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 182\u2013196. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_15"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, pp. 199\u2013208. Association for Computing Machinery (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Seeman, L., Singer, Y.: Adaptive seeding in social networks. In: 54th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, pp. 459\u2013468. Institute of Electrical and Electronic Engineers (2013)","DOI":"10.1109\/FOCS.2013.56"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, pp. 1029\u20131038. Association for Computing Machinery (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"1_CR8","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\u20133), 149\u2013156 (1999)","DOI":"10.1016\/S0166-218X(99)00103-1"},{"key":"1_CR9","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, New York, NY, USA, pp. 671\u2013680. Association for Computing Machinery (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Schwartz, R.: Online submodular maximization with preemption. In: 26th ACM-SIAM Symposium on Discrete Algorithms, Cambridge, Massachusetts, USA, pp. 1202\u20131216. Society for Industrial and Applied Mathematics (2014)","DOI":"10.1137\/1.9781611973730.80"},{"key":"1_CR11","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, Stockholm, Sweden, pp. 3829\u20133838. International Machine Learning Society (2018)"},{"key":"1_CR12","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, Long Beach, California, pp. 3311\u20133320. International Machine Learning Society (2019)"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Soma, T., Yoshida, Y.: Maximizing monotone submodular functions over the integer lattice. Math. Program. 539\u2013563 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1324-y","DOI":"10.1007\/s10107-018-1324-y"},{"key":"1_CR14","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, Beijing, China, pp. 351\u2013359. International Machine Learning Society (2014)"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10878-020-00558-4","journal-title":"J. Comb. Optim."},{"key":"1_CR16","unstructured":"Kuhnle, A., Smith, J.-D., Crawford, V., Thai, M.: Fast maximization of non-submodular, monotonic functions on the integer lattice. In: 35th International Conference on Machine Learning, Stockholm, Sweden, pp. 2786\u20132795. International Machine Learning Society (2018)"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-019-00840-8","volume":"76","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Xu, D., Wang, Y., Zhang, D.: Non-submodular maximization on massive data streams. J. Glob. Optim. 76(4), 729\u2013743 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00840-8","journal-title":"J. Glob. Optim."},{"key":"1_CR18","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-981-16-0010-4_6","volume-title":"Parallel Architectures, Algorithms and Programming","author":"J Tan","year":"2021","unstructured":"Tan, J., Zhang, D., Zhang, H., Zhang, Z.: Streaming algorithms for monotone DR-submodular maximization under a knapsack constraint on the integer lattice. In: Ning, L., Chau, V., Lau, F. (eds.) PAAP 2020. CCIS, vol. 1362, pp. 58\u201367. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-16-0010-4_6"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Guo, L., Wang, Y., Xu, D., Zhang, D.: Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice. Asia-Pac. J. Oper. Res. 2140004 (2021)","DOI":"10.1142\/S0217595921400042"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-030-69244-5_32","volume-title":"Parallel and Distributed Computing, Applications and Technologies","author":"Z Zhang","year":"2021","unstructured":"Zhang, Z., Guo, L., Wang, L., Zou, J.: A streaming model for monotone lattice submodular maximization with a cardinality constraint. In: Zhang, Y., Xu, Y., Tian, H. (eds.) PDCAT 2020. LNCS, vol. 12606, pp. 362\u2013370. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-69244-5_32"},{"key":"1_CR21","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: 28th International Conference on Machine Learning, Bellevue, WA, USA, pp. 1057\u20131064. International Machine Learning Society (2011)"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-27195-4_23","volume-title":"Algorithmic Aspects in Information and Management","author":"Q Nong","year":"2019","unstructured":"Nong, Q., Sun, T., Gong, S., Fang, Q., Du, D., Shao, X.: Maximize a monotone function with a generic submodularity ratio. In: Du, D.-Z., Li, L., Sun, X., Zhang, J. (eds.) AAIM 2019. LNCS, vol. 11640, pp. 249\u2013260. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27195-4_23"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91434-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:39:45Z","timestamp":1710232785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91434-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914332","9783030914349"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91434-9_1","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":"4 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","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":"15 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","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":"24","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":"8","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":"42% - 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":"6","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)"}}]}}