{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:18:39Z","timestamp":1742923119960,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031498145"},{"type":"electronic","value":"9783031498152"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49815-2_16","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:28Z","timestamp":1703142148000},"page":"219-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Parallel Algorithms for\u00a0Submodular p-Superseparable Maximization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8349-619X","authenticated-orcid":false,"given":"Philip","family":"Cervenjak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9101-1503","authenticated-orcid":false,"given":"Junhao","family":"Gan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3746-6704","authenticated-orcid":false,"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Rubinstein, A., Singer, Y.: An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. In: 51st STOC, pp. 66\u201377. ACM (2019)","DOI":"10.1145\/3313276.3316304"},{"key":"16_CR2","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: 30th SODA, pp. 283\u2013302. ACM-SIAM (2019)","DOI":"10.1137\/1.9781611975482.19"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Singer, Y.: The adaptive complexity of maximizing a submodular function. In: 50th STOC, pp. 1138\u20131151. ACM (2018)","DOI":"10.1145\/3188745.3188752"},{"key":"16_CR4","unstructured":"Balkanski, E., Singer, Y.: Approximation guarantees for adaptive sampling. In: 35th ICML, pp. 384\u2013393. PMLR (2018)"},{"key":"16_CR5","unstructured":"Breuer, A., Balkanski, E., Singer, Y.: The FAST algorithm for submodular maximization. In: 37th ICML, pp. 1134\u20131143. PMLR (2020)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: Submodular function maximization in parallel via the multilinear relaxation. In: 30th SODA, pp. 303\u2013322. ACM-SIAM (2019)","DOI":"10.1137\/1.9781611975482.20"},{"key":"16_CR7","unstructured":"Chen, Y., Dey, T., Kuhnle, A.: Best of both worlds: practical and theoretically optimal submodular maximization in parallel. In: Advances in Neural Information Processing Systems, vol. 34, pp. 25528\u201325539 (2021)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Dueck, D., Frey, B.J.: Non-metric affinity propagation for unsupervised image categorization. In: 11th CCV, pp. 1\u20138. IEEE (2007)","DOI":"10.1109\/ICCV.2007.4408853"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Ene, A., Nguyen, H.L.: Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time. In: 30th SODA, pp. 274\u2013282. ACM-SIAM (2019)","DOI":"10.1137\/1.9781611975482.18"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Fahrbach, M., Mirrokni, V., Zadimoghaddam, M.: Submodular maximization with nearly optimal approximation, adaptivity and query complexity. In: 30th SODA, pp. 255\u2013273. ACM-SIAM (2019)","DOI":"10.1137\/1.9781611975482.17"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0377-2217(96)00161-0","volume":"101","author":"T Grossman","year":"1997","unstructured":"Grossman, T., Wool, A.: Computational experience with approximation algorithms for the set covering problem. Eur. J. Oper. Res. 101(1), 81\u201392 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"16_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 ICML, pp. 3311\u20133320. PMLR (2019)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: 9th KDD, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"16_CR14","unstructured":"Khanna, R., Elenberg, E., Dimakis, A., Negahban, S., Ghosh, J.: Scalable greedy feature selection via weak submodularity. In: 20th AISTATS, pp. 1560\u20131568. PMLR (2017)"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1989734.1989736","volume":"2","author":"A Krause","year":"2011","unstructured":"Krause, A., Guestrin, C.: Submodularity and its applications in optimized information gathering. ACM Trans. Intell. Syst. Technol. (TIST) 2(4), 1\u201320 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"16_CR16","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(2) (2008)"},{"key":"16_CR17","unstructured":"Kuhnle, A.: Quick streaming algorithms for maximization of monotone submodular functions in linear time. In: 24th AISTATS, pp. 1360\u20131368. PMLR (2021)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: 13th KDD, pp. 420\u2013429. ACM (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Li, W., Liu, P., Vondr\u00e1k, J.: A polynomial lower bound on adaptive complexity of submodular maximization. In: 52nd STOC, pp. 140\u2013152. ACM (2020)","DOI":"10.1145\/3357713.3384311"},{"key":"16_CR20","unstructured":"Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A.: Fast constrained submodular maximization: personalized data summarization. In: 33rd ICML, pp. 1358\u20131367. PMLR (2016)"},{"issue":"3","key":"16_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177\u2013188 (1978)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"16_CR22","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-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ic.2017.10.002","volume":"257","author":"P Skowron","year":"2017","unstructured":"Skowron, P.: FPT approximation schemes for maximizing submodular functions. Inf. Comput. 257, 65\u201378 (2017)","journal-title":"Inf. Comput."},{"key":"16_CR24","unstructured":"Wei, K., Iyer, R., Bilmes, J.: Submodularity in data subset selection and active learning. In: 32nd ICML, pp. 1954\u20131963. PMLR (2015)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49815-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:04:10Z","timestamp":1703142250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49815-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498145","9783031498152"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49815-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"43","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":"16","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":"37% - 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.05","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.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}