{"id":"https://openalex.org/W4403456809","doi":"https://doi.org/10.1145/3698397","title":"Fully Dynamic Submodular Maximization over Matroids","display_name":"Fully Dynamic Submodular Maximization over Matroids","publication_year":2024,"publication_date":"2024-10-16","ids":{"openalex":"https://openalex.org/W4403456809","doi":"https://doi.org/10.1145/3698397"},"language":"en","primary_location":{"id":"doi:10.1145/3698397","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3698397","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3698397","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3698397","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001194202","display_name":"Paul D\u00fctting","orcid":"https://orcid.org/0000-0002-0635-6812"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Paul D\u00fctting","raw_affiliation_strings":["Google Research, Zurich, Switzerland","Google Research, Switzerland"],"affiliations":[{"raw_affiliation_string":"Google Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]},{"raw_affiliation_string":"Google Research, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056878852","display_name":"Federico Fusco","orcid":"https://orcid.org/0000-0001-6250-945X"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Federico Fusco","raw_affiliation_strings":["Department of Computer, Control and Management Engineering \u201cAntonio Ruberti\u201d, Sapienza University of Rome, Rome, Italy","Department of Computer, Control and Management Engineering \"Antonio Ruberti\", Sapienza University of Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer, Control and Management Engineering \u201cAntonio Ruberti\u201d, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Department of Computer, Control and Management Engineering \"Antonio Ruberti\", Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022550622","display_name":"Silvio Lattanzi","orcid":"https://orcid.org/0000-0002-3502-7559"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silvio Lattanzi","raw_affiliation_strings":["Google Research, Barcelona, Spain","Google Research, Spain"],"affiliations":[{"raw_affiliation_string":"Google Research, Barcelona, Spain","institution_ids":[]},{"raw_affiliation_string":"Google Research, Spain","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005843027","display_name":"Ashkan Norouzi-Fard","orcid":"https://orcid.org/0000-0002-2336-9826"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ashkan Norouzi-Fard","raw_affiliation_strings":["Google Research, Zurich, Switzerland","Google Research, Switzerland"],"affiliations":[{"raw_affiliation_string":"Google Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]},{"raw_affiliation_string":"Google Research, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024817143","display_name":"Morteza Zadimoghaddam","orcid":"https://orcid.org/0000-0003-0717-1120"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]},{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH","US"],"is_corresponding":false,"raw_author_name":"Morteza Zadimoghaddam","raw_affiliation_strings":["Google Research, Zurich, Switzerland","Google Research, US"],"affiliations":[{"raw_affiliation_string":"Google Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]},{"raw_affiliation_string":"Google Research, US","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5001194202"],"corresponding_institution_ids":["https://openalex.org/I4210100430"],"apc_list":null,"apc_paid":null,"fwci":1.4468,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.84314949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"21","issue":"1","first_page":"1","last_page":"23"},"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.9998000264167786,"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.9998000264167786,"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.9947999715805054,"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.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9252219200134277},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9094563722610474},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.7031325697898865},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5274622440338135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47535938024520874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47129523754119873},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3675462603569031},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3229016065597534}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9252219200134277},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9094563722610474},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7031325697898865},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5274622440338135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47535938024520874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47129523754119873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3675462603569031},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3229016065597534}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3698397","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3698397","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3698397","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1693542","is_oa":true,"landing_page_url":"https://hdl.handle.net/11573/1693542","pdf_url":"https://iris.uniroma1.it/bitstream/11573/1693542/5/Dutting_preprint_Fully_2023.pdf","source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:iris.uniroma1.it:11573/1744847","is_oa":true,"landing_page_url":"https://hdl.handle.net/11573/1744847","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3698397","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3698397","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3698397","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4403456809.pdf"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1835792195","https://openalex.org/W1875482710","https://openalex.org/W1898824936","https://openalex.org/W1989151913","https://openalex.org/W1997959284","https://openalex.org/W2132651631","https://openalex.org/W2140641199","https://openalex.org/W2143996311","https://openalex.org/W2251656679","https://openalex.org/W2540677289","https://openalex.org/W2624915851","https://openalex.org/W2753131022","https://openalex.org/W2757107770","https://openalex.org/W2788127768","https://openalex.org/W2900551979","https://openalex.org/W2912533262","https://openalex.org/W2944325705","https://openalex.org/W3034118836","https://openalex.org/W3035181444","https://openalex.org/W3041795140","https://openalex.org/W3093356333","https://openalex.org/W3105524178","https://openalex.org/W3214642224","https://openalex.org/W4254927626","https://openalex.org/W4287077057","https://openalex.org/W4318812107","https://openalex.org/W4379357816","https://openalex.org/W4390575867","https://openalex.org/W4403456809","https://openalex.org/W6785317353"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4320232260","https://openalex.org/W4252399622","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2381226549"],"abstract_inverted_index":{"Maximizing":[0],"monotone":[1],"submodular":[2],"functions":[3],"under":[4],"a":[5,9,46,70],"matroid":[6],"constraint":[7],"is":[8,45,82],"classic":[10],"algorithmic":[11],"problem":[12,26],"with":[13,55,74],"multiple":[14],"applications":[15],"in":[16,27,40],"data":[17,53],"mining":[18],"and":[19,38,66,68],"machine":[20],"learning.":[21],"We":[22],"study":[23],"this":[24],"significant":[25],"the":[28,62,77,83,86],"fully":[29],"dynamic":[30,78],"setting,":[31],"where":[32,80],"elements":[33],"can":[34],"be":[35],"both":[36],"inserted":[37],"deleted":[39],"real-time.":[41],"Our":[42],"main":[43],"result":[44],"randomized":[47],"algorithm":[48],"that":[49],"maintains":[50],"an":[51,56],"efficient":[52],"structure":[54],"\\({\\tilde{O}(\\frac{{k^{2}}}{{\\varepsilon}})}\\)":[57],"amortized":[58],"update":[59],"time":[60],"(in":[61],"number":[63],"of":[64,85],"insertions":[65],"deletions)":[67],"yields":[69],"\\({(4+O(\\varepsilon))}\\)":[71],"-approximate":[72],"solution":[73],"respect":[75],"to":[76],"optimum,":[79],"\\(k\\)":[81],"rank":[84],"matroid.":[87]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}