{"id":"https://openalex.org/W7164050920","doi":"https://doi.org/10.1145/3798129.3800915","title":"Half-Approximating Maximum Dicut in the Streaming Setting","display_name":"Half-Approximating Maximum Dicut in the Streaming Setting","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164050920","doi":"https://doi.org/10.1145/3798129.3800915"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800915","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800915","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049819184","display_name":"Amir Azarmehr","orcid":"https://orcid.org/0009-0005-6451-3985"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amir Azarmehr","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0009-0005-6451-3985","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soheil Behnezhad","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0002-0104-633X","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138257223","display_name":"Shane Ferrante","orcid":"https://orcid.org/0009-0002-1044-0117"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shane Ferrante","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0009-0002-1044-0117","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088422210","display_name":"Mohammad Saneian","orcid":"https://orcid.org/0000-0002-1669-644X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Saneian","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0001-8744-7427","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.95392267,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2118","last_page":"2129"},"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.41519999504089355,"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.41519999504089355,"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.14380000531673431,"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/T11269","display_name":"Algorithms and Data Compression","score":0.06840000301599503,"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/set","display_name":"Set (abstract data type)","score":0.2888000011444092},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.2303999960422516},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.22529999911785126},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.22050000727176666}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.476500004529953},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27649998664855957},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2671000063419342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23330000042915344},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2303999960422516},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.22529999911785126},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.22050000727176666},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.21699999272823334},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.21690000593662262}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800915","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800915","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1514114782","https://openalex.org/W2119885577","https://openalex.org/W2179494254","https://openalex.org/W2952096125","https://openalex.org/W2963634340","https://openalex.org/W2963692174","https://openalex.org/W2964228188","https://openalex.org/W3126995463","https://openalex.org/W3165922329","https://openalex.org/W4233471163","https://openalex.org/W4236077470","https://openalex.org/W4316652369","https://openalex.org/W4390098210","https://openalex.org/W4399521669","https://openalex.org/W4401830526","https://openalex.org/W4406141985"],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"streaming":[2],"algorithms":[3,80],"for":[4,54,109,146],"the":[5,26,31,34,72,75,99,117,135,169,180],"maximum":[6,35,154],"directed":[7,15,36],"cut":[8,37,62],"problem.":[9,186],"The":[10,64,105,126,187],"edges":[11],"of":[12,33,91,119,153,172,183,196],"an":[13,22],"n-vertex":[14],"graph":[16,136],"arrive":[17],"one":[18,20,101],"by":[19,79],"in":[21,71,163],"arbitrary":[23],"order,":[24],"and":[25,42,93,123,174,202],"goal":[27],"is":[28,74,98,137,176,192],"to":[29,116,189],"estimate":[30],"value":[32,156],"using":[38,60],"a":[39,48,113,131,151,193,207],"single":[40],"pass":[41],"small":[43],"space.":[44,87],"With":[45],"O(n)":[46],"space,":[47],"(1\u2212\u03b5)-approximation":[49],"can":[50,102,157],"be":[51,158],"trivially":[52],"obtained":[53,130,159],"any":[55,147],"fixed":[56],"\u03b5":[57,148],">":[58,149],"0":[59],"additive":[61],"sparsifiers.":[63],"question":[65],"that":[66,81,134,145,168],"has":[67],"attracted":[68],"significant":[69],"attention":[70],"literature":[73],"best":[76,100,107],"approximation":[77,181],"achievable":[78],"use":[82],"truly":[83],"sublinear":[84],"(i.e.,":[85],"n1\u2212\u03a9(1))":[86],"A":[88],"lower":[89,170],"bound":[90,171],"Kapralov":[92,173],"Krachun":[94,175],"(STOC\u201919)":[95],"implies":[96],".5-approximation":[97],"hope":[103],"for.":[104],"current":[106],"algorithm":[108],"general":[110],"graphs":[111],"obtains":[112],".485-approximation":[114],"due":[115],"work":[118],"Saxena,":[120],"Singer,":[121],"Sudan,":[122],"Velusamy":[124],"(FOCS\u201923).":[125],"same":[127],"authors":[128],"later":[129],"(1/2\u2212\u03b5)-approximation,":[132],"assuming":[133],"constant-degree":[138],"(SODA\u201925).":[139],"In":[140],"this":[141,184],"paper,":[142],"we":[143],"show":[144],"0,":[150],"(1/2\u2212\u03b5)-approximation":[152],"dicut":[155],"with":[160],"n1\u2212\u03a9\u03b5(1)":[161],"space":[162],"*general":[164],"graphs*.":[165],"This":[166],"shows":[167],"generally":[177],"tight,":[178],"settling":[179],"complexity":[182],"fundamental":[185],"key":[188],"our":[190],"result":[191],"careful":[194],"analysis":[195],"how":[197],"correlation":[198],"propagates":[199],"among":[200],"high-":[201],"low-degree":[203],"vertices,":[204],"when":[205],"simulating":[206],"suitable":[208],"local":[209],"algorithm.":[210]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}