{"id":"https://openalex.org/W7163537779","doi":"https://doi.org/10.48550/arxiv.2606.04946","title":"A General Framework for Dynamic Consistent Submodular Maximization","display_name":"A General Framework for Dynamic Consistent Submodular Maximization","publication_year":2026,"publication_date":"2026-06-03","ids":{"openalex":"https://openalex.org/W7163537779","doi":"https://doi.org/10.48550/arxiv.2606.04946"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.04946","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04946","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.2606.04946","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"D\u00fctting, Paul","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056878852","display_name":"Federico Fusco","orcid":"https://orcid.org/0000-0001-6250-945X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fusco, Federico","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"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":"Lattanzi, Silvio","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005843027","display_name":"Ashkan Norouzi-Fard","orcid":"https://orcid.org/0000-0002-2336-9826"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Norouzi-Fard, Ashkan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137861498","display_name":"Ola Svensson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Svensson, Ola","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024817143","display_name":"Morteza Zadimoghaddam","orcid":"https://orcid.org/0000-0003-0717-1120"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zadimoghaddam, Morteza","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.9772999882698059,"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.9772999882698059,"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.01759999990463257,"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.0012000000569969416,"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/submodular-set-function","display_name":"Submodular set function","score":0.7342000007629395},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6875},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6624000072479248},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.6504999995231628},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5516999959945679},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5293999910354614},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5238000154495239}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7342000007629395},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6875},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6624000072479248},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.6504999995231628},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5516999959945679},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5293999910354614},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5268999934196472},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5238000154495239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5152999758720398},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.39590001106262207},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3903999924659729},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.373199999332428},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33379998803138733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.302700012922287},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2596000134944916}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.04946","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04946","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.2606.04946","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04946","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":{"Consistency":[0],"is":[1,119,139],"an":[2],"important":[3],"property":[4],"in":[5,28,68],"dynamic":[6,71,136],"submodular":[7],"maximization":[8],"and":[9,50,54,82,95],"entails":[10],"maintaining":[11],"a":[12,20,45,86,112,128],"near-optimal":[13],"solution":[14,27],"at":[15],"all":[16],"times,":[17],"making":[18],"only":[19],"small":[21],"number":[22],"of":[23,47,61,76],"adjustments":[24],"to":[25,98,134],"the":[26,38,42,58,62,69,74,100,135],"each":[29],"step.":[30],"Prior":[31],"work":[32],"has":[33,51],"explored":[34],"this":[35,66,93],"question":[36,67],"for":[37,57,89,92],"insertion-only":[39],"case,":[40],"where":[41,73],"algorithm":[43],"faces":[44],"stream":[46,75],"$n$":[48],"insertions,":[49],"established":[52],"lower":[53],"upper":[55],"bounds":[56],"cardinality-constrained":[59],"version":[60],"problem.":[63],"We":[64,84],"consider":[65],"fully":[70],"setting,":[72,94],"operations":[77],"may":[78],"contain":[79],"both":[80],"insertions":[81],"deletions.":[83],"develop":[85],"general":[87],"framework":[88],"designing":[90],"algorithms":[91],"instantiate":[96],"it":[97],"obtain":[99],"first":[101],"constant-factor":[102],"approximations":[103],"with":[104],"sublinear":[105],"consistency.":[106],"For":[107,122],"cardinality":[108],"constraints,":[109,125],"we":[110,126],"propose":[111],"$\\frac":[113,129],"12":[114],"-":[115,131],"O(\\varepsilon)$":[116,132],"approximation":[117,133],"that":[118,138],"$O\\left(\\frac{1}{\\varepsilon^2}\\right)$":[120],"consistent.":[121,142],"rank-$k$":[123],"matroid":[124],"construct":[127],"14":[130],"optimum":[137],"$O\\left(\\frac{\\log":[140],"k}{\\varepsilon^2}\\right)$":[141]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-05T00:00:00"}