{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:36:20Z","timestamp":1742927780503,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967710"},{"type":"electronic","value":"9783030967727"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-96772-7_42","type":"book-chapter","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T21:13:08Z","timestamp":1647378788000},"page":"460-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Streaming Algorithms for\u00a0Maximization of\u00a0a\u00a0Non-submodular Function with\u00a0a\u00a0Cardinality Constraint on\u00a0the\u00a0Integer Lattice"],"prefix":"10.1007","author":[{"given":"Jingjing","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of KDD, pp. 671\u2013680 (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"42_CR2","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of ICML, pp. 498\u2013507 (2017)"},{"key":"42_CR3","unstructured":"Bogunovic, I., Zhao, J., Y., Cevher, V.: Robust maximization of non-submodular objectives. In: Proceedings of AISTATS, pp. 890\u2013899 (2018)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Rubinstein, A., Singer, Y.: An exponential speedup in parallel running time for submodular maximization without loss in approximation. In: Proceedings of SODA, pp. 283\u2013302 (2019)","DOI":"10.1137\/1.9781611975482.19"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Chekuri, C., P$$\\acute{\\rm a}$$l, M., Vondr$$\\acute{\\rm a}$$k, J.: Maximizing a submodular set function subject to a matroid constraint. SIAM J. Comput. 40, 1740\u20131766 (2011)","DOI":"10.1137\/080733991"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: Submodular function maximization in parallel via the multilinear relaxation. In: Proceedings of SODA, pp. 303\u2013322 (2019)","DOI":"10.1137\/1.9781611975482.20"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Das, A., Kempe, D.: Algorithms for subset selection in linear regression. In: Proceedings of STOC, pp. 45\u201354 (2008)","DOI":"10.1145\/1374376.1374384"},{"key":"42_CR8","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":"42_CR9","doi-asserted-by":"crossref","unstructured":"Ene, A., Nguyen, H.L.: Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time. In: Proceedings of SODA, pp. 274\u2013282 (2019)","DOI":"10.1137\/1.9781611975482.18"},{"key":"42_CR10","first-page":"65","volume":"32","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\ln n$$ for approximation set cover. J. ACM 32, 65\u201382 (1998)","journal-title":"J. ACM"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Izsak, R.: Welfare maximization and the supermodular degree. In: Proceedings of ITCS, pp. 247\u2013256 (2013)","DOI":"10.1145\/2422436.2422466"},{"key":"42_CR12","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42, 427\u2013486 (2011)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"42_CR13","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10898-019-00800-2","volume":"75","author":"S Gong","year":"2019","unstructured":"Gong, S., Nong, Q., Liu, W., Fang, Q.: Parametric monotone function maximization with matroid constraints. J. Global Optim. 75(3), 833\u2013849 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00800-2","journal-title":"J. Global Optim."},{"key":"42_CR14","unstructured":"Horel, T., Singer, Y.: Maximization of approximately submodular functions. In: Proceedings of NIPS, pp. 3045\u20133053 (2016)"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Huang, C., Kakimura, N.: Improved streaming algorithms for maximising monotone submodular functions under a knapsack constraint. In: Proceedings of WADS, pp. 438\u2013451 (2019)","DOI":"10.1007\/978-3-030-24766-9_32"},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s11590-019-01430-z","volume":"14","author":"YJ Jiang","year":"2020","unstructured":"Jiang, Y.J., Wang, Y.S., Xu, D.C., Yang, R.Q., Zhang, Y.: Streaming algorithm for maximizing a monotone non-submodular function under $$d$$-knapsack constraint. Optim. Lett. 14, 1235\u20131248 (2020)","journal-title":"Optim. Lett."},{"key":"42_CR17","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.M., Faloutsos, C.: Efficient sensor placement optimization for securing large water distribution networks. J. Water Resour. Plan. Manag. 134, 516\u2013526 (2008)","journal-title":"J. Water Resour. Plan. Manag."},{"key":"42_CR18","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":"42_CR19","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":"42_CR20","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"42_CR21","unstructured":"Khanna, R., Elenberg, E.R., Dimakis, A.G., Negahban S., Ghosh, J.: Scalable greedy feature selection via weak submodularity. In: Proceedings of ICAIS, pp. 1560\u20131568 (2017)"},{"key":"42_CR22","unstructured":"Kuhnle, A., Smith, J.D., Crawford, V.G., Thai, M.T.: Fast maximization of non-submodular, monotonic functions on the integer lattice. In: Proceedings of ICML, pp. 2791\u20132800 (2018)"},{"key":"42_CR23","unstructured":"Lawrence, N., Seeger, M., Herbrich, R.: Fast sparse Gaussian process methods: the informative vector machine. In: Proceedings of NIPS, pp. 625\u2013632 (2003)"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Lin, Y., Chen, W., Lui, J.C.S.: Bosting information spread: an algorithmic approach. In: Proceedings of ICDE, pp. 883\u2013894 (2017)","DOI":"10.1109\/ICDE.2017.137"},{"key":"42_CR25","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. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"42_CR26","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: Proceedings of ICML, pp. 3829\u20133838 (2018)"},{"key":"42_CR27","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, 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"42_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793830909000063","volume":"1","author":"A Shioura","year":"2009","unstructured":"Shioura, A.: On the pipage rounding algorithm for submodular function maximization-a view from discrete convex analysis. Discrete Math. Algorithms Appl. 1, 1\u201323 (2009)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"42_CR29","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":"42_CR30","unstructured":"Soma, T., Yoshida, Y.: A generalization of submodular cover via the diminishing return property on the integer lattice. In: Proceedings of NIPS, pp. 847\u2013855 (2014)"},{"key":"42_CR31","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.: Maximization monotone submodular functions over the integer lattice. Math. Program. 172, 539\u2013563 (2018)","journal-title":"Math. Program."},{"key":"42_CR32","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, 410\u2013425 (1982)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"42_CR33","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. Global Optim. 76(4), 729\u2013743 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00840-8","journal-title":"J. Global Optim."},{"key":"42_CR34","first-page":"195","volume":"36","author":"RQ Yang","year":"2019","unstructured":"Yang, R.Q., Xu, D.C., Jiang, Y.J., Wang, Y.S., Zhang, D.M.: Approximation robust parameterized submodular function maximization in large-scales. Asia Pac. J. Oper. Res. 36, 195\u2013220 (2019)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"42_CR35","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-021-01014-1","volume":"80","author":"ZN Zhang","year":"2021","unstructured":"Zhang, Z.N., Du, D.L., Jiang, Y.J., Wu, C.C.: Maximizing DR-submodular+supermodular function on the integer lattice subject to a cardinality constraint. J. Glob. Optim. 80, 595\u2013616 (2021)","journal-title":"J. Glob. Optim."},{"key":"42_CR36","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s10898-009-9511-2","volume":"48","author":"X Zhu","year":"2010","unstructured":"Zhu, X., Yu, J., Lee, W.D., Shan, S., Du, D.Z.: New domination sets in social networks. J. Glob. Optim. 48, 633\u2013642 (2010)","journal-title":"J. Glob. 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-3-030-96772-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T21:19:05Z","timestamp":1647379145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96772-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967710","9783030967727"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96772-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","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":"Guangzhou","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.sysu.edu.cn\/pdcat2021\/","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":"97","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":"34","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":"25% - 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":"7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}