{"id":"https://openalex.org/W7117682319","doi":"https://doi.org/10.48550/arxiv.2512.22729","title":"Half-Approximating Maximum Dicut in the Streaming Setting","display_name":"Half-Approximating Maximum Dicut in the Streaming Setting","publication_year":2025,"publication_date":"2025-12-28","ids":{"openalex":"https://openalex.org/W7117682319","doi":"https://doi.org/10.48550/arxiv.2512.22729"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2512.22729","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.22729","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2512.22729","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049819184","display_name":"Amir Azarmehr","orcid":"https://orcid.org/0009-0005-6451-3985"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Azarmehr, Amir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Behnezhad, Soheil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121670550","display_name":"Shane Ferrante","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ferrante, Shane","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088422210","display_name":"Mohammad Saneian","orcid":"https://orcid.org/0000-0002-1669-644X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saneian, Mohammad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9721999764442444,"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.9721999764442444,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.012600000016391277,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/sublinear-function","display_name":"Sublinear function","score":0.7527999877929688},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6718999743461609},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4763999879360199},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.47049999237060547},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4571000039577484},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.44440001249313354},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.41659998893737793},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3912000060081482}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7527999877929688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7021999955177307},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6718999743461609},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4763999879360199},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.47049999237060547},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4571000039577484},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.44440001249313354},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4390000104904175},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.41659998893737793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4034999907016754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3912000060081482},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38179999589920044},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32659998536109924},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.2703000009059906},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.25099998712539673},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2506999969482422},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2512.22729","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.22729","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2512.22729","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.22729","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"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-\\varepsilon)$-approximation":[49],"can":[50,102,157],"be":[51,158],"trivially":[52],"obtained":[53,130,159],"any":[55,147],"fixed":[56],"$\\varepsilon":[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],"$n^{1-\u03a9(1)}$)":[86],"A":[88],"lower":[89,170],"bound":[90,171],"Kapralov":[92,173],"Krachun":[94,175],"(STOC'19)":[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'23).":[125],"same":[127],"authors":[128],"later":[129],"$(1/2-\\varepsilon)$-approximation,":[132],"assuming":[133],"constant-degree":[138],"(SODA'25).":[139],"In":[140],"this":[141,184],"paper,":[142],"we":[143],"show":[144],"0$,":[150],"$(1/2-\\varepsilon)$-approximation":[152],"dicut":[155],"with":[160],"$n^{1-\u03a9_\\varepsilon(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":"2025-12-31T00:00:00"}