{"id":"https://openalex.org/W7160397085","doi":"https://doi.org/10.48550/arxiv.2605.03071","title":"A Poisson Process for Submodular Maximization","display_name":"A Poisson Process for Submodular Maximization","publication_year":2026,"publication_date":"2026-05-04","ids":{"openalex":"https://openalex.org/W7160397085","doi":"https://doi.org/10.48550/arxiv.2605.03071"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.03071","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03071","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.2605.03071","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135464418","display_name":"Amit Ganz Rozenman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rozenman, Amit Ganz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001714646","display_name":"Ariel Kulik","orcid":"https://orcid.org/0000-0002-0533-3926"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kulik, Ariel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schwartz, Roy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135464648","display_name":"Mohit Singh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Singh, Mohit","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.9659000039100647,"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.9659000039100647,"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.009700000286102295,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.004699999932199717,"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/submodular-set-function","display_name":"Submodular set function","score":0.8968999981880188},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.520799994468689},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4375999867916107},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.4350000023841858},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42989999055862427},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4253000020980835},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.42489999532699585},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.39329999685287476}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8968999981880188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6951000094413757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.569599986076355},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.520799994468689},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4375999867916107},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.4350000023841858},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42989999055862427},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4253000020980835},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.42489999532699585},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.39329999685287476},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.335999995470047},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.3111000061035156},{"id":"https://openalex.org/C100906024","wikidata":"https://www.wikidata.org/wiki/Q205692","display_name":"Poisson distribution","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25929999351501465}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.03071","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03071","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.2605.03071","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03071","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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5570879578590393}],"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,65,116],"study":[1],"the":[2,40,87,97,133],"problem":[3,75],"of":[4,24,34,120],"maximizing":[5],"a":[6,12,19,21,31,67,80],"monotone":[7],"submodular":[8,128],"function":[9],"subject":[10],"to":[11,54,73],"matroid":[13],"independence":[14],"constraint.":[15],"For":[16],"more":[17],"than":[18],"decade,":[20],"rich":[22],"body":[23],"work":[25],"has":[26],"studied":[27],"this":[28,56,74],"problem.":[29],"Initially,":[30],"tight":[32,57,88],"approximation":[33,58,91],"$":[35,89],"(1-\\frac{1}{e})$":[36,90],"was":[37],"given":[38],"using":[39],"continuous":[41],"greedy":[42],"algorithm":[43],"[Calinescu-Chekuri-Pal-Vondr{\u00e1}k":[44],"STOC`2008]":[45],"and":[46,62,69,93,123,131,135],"later":[47],"non-oblivious":[48],"local":[49],"search":[50],"techniques":[51,100],"were":[52],"able":[53],"match":[55],"guarantee":[59,92],"[Filmus-Ward":[60],"FOCS`2012]":[61],"[Buchbinder-Feldman":[63],"FOCS`2024].":[64],"propose":[66],"new":[68],"remarkably":[70],"simple":[71],"approach":[72,85,122],"that":[76],"is":[77],"based":[78],"on":[79],"stochastic":[81],"Poisson":[82],"process.":[83],"Our":[84],"matches":[86],"it":[94,102],"differs":[95],"from":[96],"known":[98],"two":[99],"since":[101],"does":[103],"not":[104],"require":[105],"discretization":[106],"or":[107],"rounding":[108],"while":[109],"performing":[110],"very":[111],"few":[112],"single":[113],"element":[114],"swaps.":[115],"also":[117],"present":[118],"applications":[119],"our":[121],"obtain":[124],"fast":[125],"algorithms":[126],"for":[127,132],"welfare":[129],"maximization,":[130],"general":[134],"separable":[136],"assignment":[137],"problems.":[138]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-07T00:00:00"}