{"id":"https://openalex.org/W2948282142","doi":"https://doi.org/10.1145/3294052.3319691","title":"Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model","display_name":"Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2948282142","doi":"https://doi.org/10.1145/3294052.3319691","mag":"2948282142"},"language":"en","primary_location":{"id":"doi:10.1145/3294052.3319691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3294052.3319691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3294052.3319691","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3294052.3319691","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076056716","display_name":"Piotr Indyk","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Piotr Indyk","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052582756","display_name":"Ali Vakilian","orcid":"https://orcid.org/0000-0001-5049-7594"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Vakilian","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076056716"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.3579,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82809313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.6978944540023804},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5986245274543762},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.577244758605957},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5694659352302551},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5006816387176514},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4876896142959595},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.483917772769928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4834657311439514},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43465837836265564},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42626750469207764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3850880563259125},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3557235598564148},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1069406270980835}],"concepts":[{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.6978944540023804},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5986245274543762},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.577244758605957},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5694659352302551},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5006816387176514},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4876896142959595},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.483917772769928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4834657311439514},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43465837836265564},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42626750469207764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3850880563259125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3557235598564148},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1069406270980835},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3294052.3319691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3294052.3319691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3294052.3319691","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3294052.3319691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3294052.3319691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3294052.3319691","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2948282142.pdf","grobid_xml":"https://content.openalex.org/works/W2948282142.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W112063162","https://openalex.org/W209373873","https://openalex.org/W398859631","https://openalex.org/W1493892051","https://openalex.org/W1557064786","https://openalex.org/W1592346261","https://openalex.org/W1680189815","https://openalex.org/W1785933978","https://openalex.org/W1941041180","https://openalex.org/W1956340982","https://openalex.org/W1997010704","https://openalex.org/W1997959284","https://openalex.org/W2025622191","https://openalex.org/W2038428842","https://openalex.org/W2050026004","https://openalex.org/W2063844956","https://openalex.org/W2069414131","https://openalex.org/W2080745194","https://openalex.org/W2103126020","https://openalex.org/W2107917944","https://openalex.org/W2143996311","https://openalex.org/W2148372359","https://openalex.org/W2152489475","https://openalex.org/W2153977620","https://openalex.org/W2225326649","https://openalex.org/W2258899852","https://openalex.org/W2290252992","https://openalex.org/W2295455748","https://openalex.org/W2300360052","https://openalex.org/W2537285447","https://openalex.org/W2541589100","https://openalex.org/W2567730220","https://openalex.org/W2591972614","https://openalex.org/W2594477286","https://openalex.org/W2748190518","https://openalex.org/W2776009846","https://openalex.org/W2778880769","https://openalex.org/W2804373447","https://openalex.org/W2890891613","https://openalex.org/W2951668958","https://openalex.org/W2963799254","https://openalex.org/W3100689448","https://openalex.org/W4285719527","https://openalex.org/W6743219848"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W4312814274","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W2295466155","https://openalex.org/W4234540089","https://openalex.org/W1613953984","https://openalex.org/W2964056228"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,7,31,69,73,87,95],"maximum":[3,88],"k-coverage":[4],"problem":[5],"in":[6,53,113],"general":[8],"edge-arrival":[9],"streaming":[10,83,138],"model:":[11],"given":[12],"a":[13,22,47,61,105],"collection":[14],"of":[15,21,25,28,49,80],"m":[16],"sets":[17,37,43],"F,":[18],"each":[19],"subset":[20],"ground":[23],"set":[24],"elements":[26],"U":[27],"size":[29],"n,":[30],"task":[32],"is":[33,40,60,99],"to":[34,64,130],"find":[35],"k":[36],"whose":[38],"coverage":[39,89],"maximized.":[41],"The":[42],"are":[44],"specified":[45],"as":[46],"sequence":[48],"(element,":[50],"set)":[51],"pairs":[52],"an":[54,110],"arbitrary":[55],"order.":[56],"Our":[57,119],"main":[58],"result":[59],"tight":[62],"(up":[63],"polylogarithmic":[65],"factors)":[66],"trade-off":[67],"between":[68,133],"space":[70,97],"complexity":[71],"and":[72,137],"approximation":[74],"factor":[75],"\u03b1\\in(1/(1-1/e),":[76],"\\tildeOmega":[77],"(\\sqrtm":[78],")]$":[79],"any":[81],"single-pass":[82,106],"algorithm":[84,107,120],"that":[85,94,108],"estimates":[86],"size.":[90],"Specifically,":[91],"we":[92,103],"show":[93],"optimal":[96],"bound":[98],"$\\tildeTheta":[100],"(m/\u03b1^2)$.":[101],"Moreover,":[102],"design":[104],"reports":[109],"\u03b1-approximate":[111],"solution":[112],"$\\tildeO":[114],"(m/\u03b1^2":[115],"+":[116],"k)$":[117],"space.":[118],"heavily":[121],"exploits":[122],"data":[123],"stream":[124],"sketching":[125,135],"techniques,":[126],"which":[127],"could":[128],"lead":[129],"further":[131],"connections":[132],"vector":[134],"methods":[136],"algorithms":[139],"for":[140],"combinatorial":[141],"optimization":[142],"tasks.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}