{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:32:32Z","timestamp":1757309552292,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"EPSRC","award":["EP\/V010611\/1, EP\/T517872\/1"],"award-info":[{"award-number":["EP\/V010611\/1, EP\/T517872\/1"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1934876, CCF-2008305"],"award-info":[{"award-number":["CCF-1934876, CCF-2008305"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,18]]},"DOI":"10.1145\/3584372.3588678","type":"proceedings-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:21:22Z","timestamp":1685744482000},"page":"127-139","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Set Cover in the One-pass Edge-arrival Streaming Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2601-1689","authenticated-orcid":false,"given":"Sanjeev","family":"Khanna","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1802-4011","authenticated-orcid":false,"given":"Christian","family":"Konrad","sequence":"additional","affiliation":[{"name":"University of Bristol, Bristol, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2921-7434","authenticated-orcid":false,"given":"Cezar-Mihail","family":"Alexandru","sequence":"additional","affiliation":[{"name":"University of Bristol, Bristol, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2023,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056116"},{"key":"e_1_3_2_1_2_1","volume-title":"48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12--16, 2021, Glasgow, Scotland (Virtual Conference) (LIPIcs","volume":"13","author":"Assadi Sepehr","year":"2021","unstructured":"Sepehr Assadi and Soheil Behnezhad. 2021. Beating Two-Thirds For Random-Order Streaming Matching. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12--16, 2021, Glasgow, Scotland (Virtual Conference) (LIPIcs, Vol. 198), Nikhil Bansal, Emanuela Merelli, and James Worrell (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 19:1--19:13."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2021.6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1095482"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976472.14"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087585"},{"key":"e_1_3_2_1_7_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbr\u00fc cken, Germany (Virtual Conference) (LIPIcs","volume":"13","author":"Bernstein Aaron","year":"2020","unstructured":"Aaron Bernstein. 2020. Improved Bounds for Matching in Random-Order Streams. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbr\u00fc cken, Germany (Virtual Conference) (LIPIcs, Vol. 168), , Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 12:1--12:13."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.25"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214414"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch94"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871501"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--45174--8_33"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2957322"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2022.59"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902287"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2017.12"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.55"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.107"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.93"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--32512-0_20"},{"key":"e_1_3_2_1_21_1","volume-title":"Lazy and Eager Approaches for the Set Cover Problem. In Thirty-Seventh Australasian Computer Science Conference, ACSC 2014","volume":"27","author":"Lim C. L.","year":"2014","unstructured":"C. L. Lim, Alistair Moffat, and Anthony Ian Wirth. 2014. Lazy and Eager Approaches for the Set Cover Problem. In Thirty-Seventh Australasian Computer Science Conference, ACSC 2014, Auckland, New Zealand, January 2014 (CRPIT, Vol. 147), , Bruce Thomas and Dave Parry (Eds.). Australian Computer Society, 19--27. http:\/\/crpit.scem.westernsydney.edu.au\/abstracts\/CRPITV147Lim.html"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.60"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783315"}],"event":{"name":"SIGMOD\/PODS '23: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Seattle WA USA","acronym":"SIGMOD\/PODS '23"},"container-title":["Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3584372.3588678","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584372.3588678","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584372.3588678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:29Z","timestamp":1750178789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":23,"alternative-id":["10.1145\/3584372.3588678","10.1145\/3584372"],"URL":"https:\/\/doi.org\/10.1145\/3584372.3588678","relation":{},"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"2023-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}