{"id":"https://openalex.org/W7161341549","doi":"https://doi.org/10.48550/arxiv.2605.14296","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","display_name":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","publication_year":2026,"publication_date":"2026-05-14","ids":{"openalex":"https://openalex.org/W7161341549","doi":"https://doi.org/10.48550/arxiv.2605.14296"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.14296","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.14296","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.14296","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Buchbinder, Niv","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136233605","display_name":"Moran Feldman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feldman, Moran","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136190653","display_name":"Siyue Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Siyue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070665261","display_name":"Sherry Sarkar","orcid":"https://orcid.org/0009-0006-9994-1733"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarkar, Sherry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.9302999973297119,"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.9302999973297119,"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.024900000542402267,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.02199999988079071,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9204000234603882},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.84579998254776},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5192999839782715},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5074999928474426},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4708999991416931},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46549999713897705},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4487000107765198},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.44769999384880066}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9204000234603882},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.84579998254776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5738999843597412},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5192999839782715},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5074999928474426},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4708999991416931},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4668000042438507},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46549999713897705},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4487000107765198},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.427700012922287},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36419999599456787},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.3578000068664551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.349700003862381},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C32645036","wikidata":"https://www.wikidata.org/wiki/Q475164","display_name":"Stochastic ordering","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33489999175071716},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3285999894142151},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.32359999418258667},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.3034000098705292},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2752000093460083},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.14296","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.14296","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.14296","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.14296","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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,113],"study":[1],"random":[2,54,82,151],"order":[3,55,83,152],"semi-streaming":[4,84,153,160],"algorithms":[5,144],"for":[6,45,94,102,124,145,168],"submodular":[7,106],"maximization":[8],"under":[9],"a":[10,77,104,110,116,121,138,159,163],"wide":[11],"range":[12],"of":[13,27,30,64,71,91,148,162],"combinatorial":[14],"constraint":[15],"classes,":[16],"including":[17],"matroids,":[18,49,72],"matroid":[19,111,169],"$p$-parity,":[20],"$p$-exchange":[21],"systems":[22],"and":[23,51,59,81,86],"$p$-systems.":[24,125],"For":[25,48],"most":[26],"these":[28,65],"classes":[29,147],"constraints,":[31],"our":[32,73],"results":[33,56,75,127],"are":[34,128],"the":[35,69,89],"first":[36],"improvement":[37],"over":[38,62],"what":[39],"is":[40,158],"known":[41],"to":[42,109,141],"be":[43],"achievable":[44],"adversarial":[46,80],"order.":[47],"matching":[50],"$p$-matchoids,":[52],"previous":[53],"were":[57],"known,":[58],"we":[60],"improve":[61,88],"some":[63],"as":[66],"well.":[67],"In":[68],"case":[70],"improved":[74],"show":[76],"separation":[78,123],"between":[79],"algorithms,":[85],"exponentially":[87],"number":[90],"passes":[92],"necessary":[93],"getting":[95],"$1":[96],"-":[97,99],"1/e":[98],"\\varepsilon$":[100],"approximation":[101],"maximizing":[103],"monotone":[105],"function":[107],"subject":[108],"constraint.":[112],"also":[114],"prove":[115],"new":[117,132],"hardness":[118],"result":[119],"showing":[120],"similar":[122],"Our":[126],"based":[129],"on":[130],"two":[131],"technical":[133],"tools.":[134],"One":[135],"tool":[136,157],"provides":[137],"general":[139],"way":[140],"translate":[142],"offline":[143,166],"many":[146],"constraints":[149],"into":[150],"algorithms.":[154],"The":[155],"other":[156],"variant":[161],"recently":[164],"proposed":[165],"algorithm":[167],"constraints.":[170]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-16T00:00:00"}