{"id":"https://openalex.org/W7163984456","doi":"https://doi.org/10.1145/3798129.3800918","title":"A Poisson Process for Submodular Maximization","display_name":"A Poisson Process for Submodular Maximization","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7163984456","doi":"https://doi.org/10.1145/3798129.3800918"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800918","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800918","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.3800918","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138270127","display_name":"Amit Ganz Rozenman","orcid":"https://orcid.org/0009-0001-4801-1492"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amit Ganz Rozenman","raw_affiliation_strings":["Technion, Haifa, Israel"],"raw_orcid":"https://orcid.org/0009-0001-4801-1492","affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001714646","display_name":"Ariel Kulik","orcid":"https://orcid.org/0000-0002-0533-3926"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ariel Kulik","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":"https://orcid.org/0000-0002-0533-3926","affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Roy Schwartz","raw_affiliation_strings":["Technion, Haifa, Israel"],"raw_orcid":"https://orcid.org/0009-0002-3423-721X","affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020914506","display_name":"Mohit Singh","orcid":"https://orcid.org/0000-0002-0827-233X"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohit Singh","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, USA"],"raw_orcid":"https://orcid.org/0000-0002-0827-233X","affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"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.94985876,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2152","last_page":"2163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11716","display_name":"Random Matrices and Applications","score":0.11840000003576279,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11716","display_name":"Random Matrices and Applications","score":0.11840000003576279,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.08420000225305557,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.050599999725818634,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9294000267982483},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.647599995136261},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5608000159263611},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5576000213623047},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5480999946594238},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4277999997138977},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.4262000024318695}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9294000267982483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6965000033378601},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.647599995136261},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5608000159263611},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5576000213623047},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5480999946594238},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5476999878883362},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4277999997138977},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.42500001192092896},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.39590001106262207},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35830000042915344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33899998664855957},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C100906024","wikidata":"https://www.wikidata.org/wiki/Q205692","display_name":"Poisson distribution","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800918","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800918","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.3800918","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800918","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":[{"id":"https://openalex.org/G4230961166","display_name":null,"funder_award_id":"852870","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G4941577786","display_name":null,"funder_award_id":"2504994","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G571931939","display_name":null,"funder_award_id":"2106444","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W39861960","https://openalex.org/W1970560785","https://openalex.org/W1976035292","https://openalex.org/W1981351071","https://openalex.org/W1983481354","https://openalex.org/W1989453388","https://openalex.org/W1995275762","https://openalex.org/W2004045061","https://openalex.org/W2032408534","https://openalex.org/W2035337032","https://openalex.org/W2038938388","https://openalex.org/W2045492898","https://openalex.org/W2049451257","https://openalex.org/W2053381548","https://openalex.org/W2061820396","https://openalex.org/W2064933851","https://openalex.org/W2072291569","https://openalex.org/W2109309418","https://openalex.org/W2110373679","https://openalex.org/W2113437680","https://openalex.org/W2118947995","https://openalex.org/W2120173366","https://openalex.org/W2126307323","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2145825677","https://openalex.org/W2158760370","https://openalex.org/W2179494254","https://openalex.org/W2209990155","https://openalex.org/W2569511777","https://openalex.org/W2579645839","https://openalex.org/W2757107770","https://openalex.org/W2949112927","https://openalex.org/W2964020479","https://openalex.org/W3003506411","https://openalex.org/W4231490457","https://openalex.org/W4234897719","https://openalex.org/W4251076636","https://openalex.org/W4290927726","https://openalex.org/W4292070111","https://openalex.org/W4388634979","https://openalex.org/W4399522278","https://openalex.org/W4399523324","https://openalex.org/W4404848982","https://openalex.org/W4411319954"],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,39],"problem":[3],"of":[4,24,34],"maximizing":[5],"a":[6,12,19,21,31],"monotone":[7],"submodular":[8],"function":[9],"subject":[10],"to":[11,53],"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,55],"problem.":[29],"Initially,":[30],"tight":[32,56],"approximation":[33,57],"(1\u22121e)":[35],"was":[36],"given":[37],"using":[38],"continuous":[40],"greedy":[41],"algorithm":[42],"[Calinescu-Chekuri-Pal-Vondr\u00e1k":[43],"STOC\u20182008]":[44],"and":[45,61],"later":[46],"non-oblivious":[47],"local":[48],"search":[49],"techniques":[50],"were":[51],"able":[52],"match":[54],"guarantee":[58],"[Filmus-Ward":[59],"FOCS\u20182012]":[60],"[Buchbinder-Feldman":[62],"FOCS\u20182024].":[63]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}