{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:03:19Z","timestamp":1757617399079,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826696"},{"type":"electronic","value":"9783031826702"}],"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-3-031-82670-2_13","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:39:33Z","timestamp":1738816773000},"page":"166-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Massively Parallel Maximum Coverage Revisited"],"prefix":"10.1007","author":[{"given":"Thai","family":"Bui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoa T.","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Becchetti, L., Bordino, I., Leonardi, S., Mele, I., Sankowski, P.: Stochastic query covering for fast approximate document retrieval. ACM Trans. Inf. Syst. 33(3), 11:1\u201311:35 (2015)","DOI":"10.1145\/2699671"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Assadi, S.: Tight space-approximation tradeoff for the multi-pass streaming set cover problem. In: PODS, pp. 321\u2013335. ACM (2017)","DOI":"10.1145\/3034786.3056116"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Assadi, S., Khanna, S.: Tight bounds on the round complexity of the distributed maximum coverage problem. In: SODA, pp. 2412\u20132431. SIAM (2018)","DOI":"10.1137\/1.9781611975031.155"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Assadi, S., Khanna, S., Li, Y.: Tight bounds for single-pass streaming complexity of the set cover problem. SIAM J. Comput. 50(3) (2021)","DOI":"10.1137\/16M1095482"},{"key":"13_CR6","unstructured":"Cervenjak, P., Gan, J., Umboh, S.W., Wirth, A.: Maximum unique coverage on streams: improved FPT approximation scheme and tighter space lower bound. In: APPROX\/RANDOM. LIPIcs, vol.\u00a0317, pp. 25:1\u201325:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"13_CR7","unstructured":"Chakrabarti, A., McGregor, A., Wirth, A.: Improved algorithms for maximum coverage in dynamic and random order streams. CoRR abs\/2403.14087 (2024)"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Indyk, P., Mahabadi, S., Vakilian, A.: Towards tight bounds for the streaming set cover problem. In: PODS, pp. 371\u2013383. ACM (2016)","DOI":"10.1145\/2902251.2902287"},{"issue":"6","key":"13_CR10","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage. Naval Res. Logistics (NRL) 45(6), 615\u2013627 (1998)","journal-title":"Naval Res. Logistics (NRL)"},{"key":"13_CR11","unstructured":"Indyk, P., Mahabadi, S., Rubinfeld, R., Ullman, J.R., Vakilian, A., Yodpinyanee, A.: Fractional set cover in the streaming model. In: APPROX-RANDOM. LIPIcs, vol.\u00a081, pp. 12:1\u201312:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P., Vakilian, A.: Tight trade-offs for the maximum k-coverage problem in the general streaming model. In: PODS, pp. 200\u2013217. ACM (2019)","DOI":"10.1145\/3294052.3319691"},{"key":"13_CR13","unstructured":"Jaud, S., Wirth, A., Choudhury, F.M.: Maximum coverage in sublinear space, faster. In: SEA. LIPIcs, vol.\u00a0265, pp. 21:1\u201321:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: SODA, pp. 938\u2013948. SIAM (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theory Comput. 11, 105\u2013147 (2015)","journal-title":"Theory Comput."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Khanna, S., Konrad, C., Alexandru, C.: Set cover in the one-pass edge-arrival streaming model. In: PODS, pp. 127\u2013139. ACM (2023)","DOI":"10.1145\/3584372.3588678"},{"key":"13_CR17","unstructured":"Krause, A., Guestrin, C.: Near-optimal observation selection using submodular functions. In: AAAI, pp. 1650\u20131654. AAAI Press (2007)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Kumar, R., Moseley, B., Vassilvitskii, S., Vattani, A.: Fast greedy algorithms in MapReduce and streaming. ACM Trans. Parallel Comput. 2(3), 14:1\u201314:22 (2015)","DOI":"10.1145\/2809814"},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"RE Ladner","year":"1980","unstructured":"Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM 27(4), 831\u2013838 (1980)","journal-title":"J. ACM"},{"key":"13_CR20","unstructured":"Liu, P., Vondr\u00e1k, J.: Submodular optimization in the MapReduce model. In: SOSA. OASIcs, vol.\u00a069, pp. 18:1\u201318:10. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"13_CR21","unstructured":"McGregor, A., Tench, D., Vu, H.T.: Maximum coverage in the data stream model: Parameterized and generalized. In: ICDT. LIPIcs, vol.\u00a0186, pp. 12:1\u201312:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"7","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1007\/s00224-018-9878-x","volume":"63","author":"A McGregor","year":"2019","unstructured":"McGregor, A., Vu, H.T.: Better streaming algorithms for the maximum coverage problem. Theory Comput. Syst. 63(7), 1595\u20131619 (2019)","journal-title":"Theory Comput. Syst."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"da\u00a0Ponte\u00a0Barbosa, R., Ene, A., Nguyen, H.L., Ward, J.: A new framework for distributed submodular maximization. In: FOCS, pp. 645\u2013654. IEEE Computer Society (2016)","DOI":"10.1109\/FOCS.2016.74"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Saha, B., Getoor, L.: On maximum coverage in the streaming model & application to multi-topic blog-watch. In: SDM, pp. 697\u2013708. SIAM (2009)","DOI":"10.1137\/1.9781611972795.60"},{"key":"13_CR25","unstructured":"Warneke, R., Choudhury, F.M., Wirth, A.: Maximum coverage in random-arrival streams. In: ESA. LIPIcs, vol.\u00a0274, pp. 102:1\u2013102:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:40:51Z","timestamp":1757133651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}