{"id":"https://openalex.org/W4378474166","doi":"https://doi.org/10.48550/arxiv.2305.15192","title":"Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time","display_name":"Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time","alternate_titles":[],"publication_year":2023,"publication_date":"2023-05-24","ids":{"openalex":"https://openalex.org/W4378474166","doi":"https://doi.org/10.48550/arxiv.2305.15192"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2305.15192","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.15192","pdf_url":"https://arxiv.org/pdf/2305.15192","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W4378474166"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2305.15192","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045451093","display_name":"Kiarash Banihashem","orcid":"https://orcid.org/0000-0001-7110-5238","observed_orcids":["https://orcid.org/0000-0001-7110-5238"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Banihashem, Kiarash","raw_affiliation_strings":["Computer Science Department , University of Maryland , College Park , MD , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department , University of Maryland , College Park , MD , USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071674547","display_name":"Leyla Biabani","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Biabani, Leyla","raw_affiliation_strings":["Department of Mathematics and Computer Science , TU Eindhoven , the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science , TU Eindhoven , the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090116847","display_name":"Samira Goudarzi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Goudarzi, Samira","raw_affiliation_strings":["Computer Science Department , University of Maryland , College Park , MD , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department , University of Maryland , College Park , MD , USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":"https://orcid.org/0000-0003-4842-0533","observed_orcids":["https://orcid.org/0000-0003-4842-0533"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hajiaghayi, MohammadTaghi","raw_affiliation_strings":["Computer Science Department , University of Maryland , College Park , MD , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department , University of Maryland , College Park , MD , USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092086111","display_name":"Peyman Jabbarzade","orcid":"https://orcid.org/0000-0002-5413-2231","observed_orcids":["https://orcid.org/0000-0002-5413-2231"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"Jabbarzade, Peyman","raw_affiliation_strings":["Computer Science Department , University of Maryland , College Park , MD , USA","Department of Mathematics and Computer Science , TU Eindhoven , the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department , University of Maryland , College Park , MD , USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science , TU Eindhoven , the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055267502","display_name":"Morteza Monemizadeh","orcid":"https://orcid.org/0000-0002-8459-7822","observed_orcids":["https://orcid.org/0000-0002-8459-7822"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Monemizadeh, Morteza","raw_affiliation_strings":["Computer Science Department , University of Maryland , College Park , MD , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department , University of Maryland , College Park , MD , USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8682000041007996,"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.8682000041007996,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.026100000366568565,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.017100000753998756,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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-maximization","display_name":"submodular maximization","score":0.8960000276565552},{"id":"https://openalex.org/keywords/cardinality-constraints","display_name":"cardinality constraints","score":0.9549999833106995},{"id":"https://openalex.org/keywords/dynamic-algorithms","display_name":"dynamic algorithms","score":0.8009999990463257},{"id":"https://openalex.org/keywords/streaming-algorithms","display_name":"streaming algorithms","score":0.3930000066757202},{"id":"https://openalex.org/keywords/amortized-update-time","display_name":"amortized update time","score":0.8659999966621399},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.8529999852180481},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.5669999718666077},{"id":"https://openalex.org/keywords/monotone-submodular-functions","display_name":"monotone submodular functions","score":0.7540000081062317}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8092408180236816},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6744694113731384},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6411711573600769},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6162588000297546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5874758362770081},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.5120980739593506},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5016498565673828},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48164525628089905},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4795672297477722},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.43512922525405884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43319380283355713},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4159160256385803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25232720375061035},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.17597699165344238},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2305.15192","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.15192","pdf_url":"https://arxiv.org/pdf/2305.15192","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2305.15192","doi":"https://doi.org/10.48550/arxiv.2305.15192","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2305.15192","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2305.15192","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.15192","pdf_url":"https://arxiv.org/pdf/2305.15192","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4378474166.pdf","grobid_xml":"https://content.openalex.org/works/W4378474166.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W238058561","https://openalex.org/W1680189815","https://openalex.org/W1981297517","https://openalex.org/W1997959284","https://openalex.org/W2108858998","https://openalex.org/W2153329369","https://openalex.org/W2177862760","https://openalex.org/W2215252637","https://openalex.org/W2225560834","https://openalex.org/W2245821616","https://openalex.org/W2537285447","https://openalex.org/W2594013402","https://openalex.org/W2751899817","https://openalex.org/W2753620122","https://openalex.org/W2762932471","https://openalex.org/W2770005701","https://openalex.org/W2788127768","https://openalex.org/W2804439311","https://openalex.org/W2883693373","https://openalex.org/W2894187248","https://openalex.org/W2955409066","https://openalex.org/W2967626403","https://openalex.org/W2970345470","https://openalex.org/W2974991453","https://openalex.org/W3017091341","https://openalex.org/W3021174677","https://openalex.org/W3034118836","https://openalex.org/W3036409308","https://openalex.org/W3098434450","https://openalex.org/W3122282375","https://openalex.org/W3202772786","https://openalex.org/W3214642224","https://openalex.org/W3215769573","https://openalex.org/W4205921540"],"related_works":["https://openalex.org/W3034118836","https://openalex.org/W3214642224","https://openalex.org/W7133245602","https://openalex.org/W7138993363","https://openalex.org/W4403456809","https://openalex.org/W4410049535","https://openalex.org/W4285324891","https://openalex.org/W4410061271","https://openalex.org/W7134120941","https://openalex.org/W7163537779"],"abstract_inverted_index":{"Maximizing":[0],"a":[1,10,47,72,90,97,103,123,140,151,163,183,191,202],"monotone":[2],"submodular":[3,195],"function":[4],"under":[5,197],"cardinality":[6,198],"constraint":[7,199],"$k$":[8,200],"is":[9,60,65,133,174],"core":[11],"problem":[12,40,95,128,157,188],"in":[13,41,113,137,176],"machine":[14],"learning":[15],"and":[16,24,33,51,62,102,145],"database":[17],"with":[18,96,129,162],"many":[19],"basic":[20],"applications,":[21],"including":[22],"video":[23],"data":[25],"summarization,":[26],"recommendation":[27],"systems,":[28],"feature":[29],"extraction,":[30],"exemplar":[31],"clustering,":[32],"coverage":[34],"problems.":[35],"We":[36],"study":[37],"this":[38,94,114,179],"classic":[39],"the":[42,63,116,127,156,187],"fully":[43],"dynamic":[44,91,124],"model":[45],"where":[46],"stream":[48],"of":[49,53,55,139],"insertions":[50],"deletions":[52],"elements":[54],"an":[56,68,169],"underlying":[57],"ground":[58],"set":[59],"given":[61],"goal":[64],"to":[66,88],"maintain":[67],"approximate":[69],"solution":[70,193],"using":[71,201],"fast":[73],"update":[74,131,205],"time.":[75,206],"A":[76],"recent":[77,141],"paper":[78],"at":[79,147],"NeurIPS'20":[80],"by":[81,107,143],"Lattanzi,":[82],"Mitrovic,":[83],"Norouzi{-}Fard,":[84],"Tarnawski,":[85],"Zadimoghaddam":[86],"claims":[87],"obtain":[89],"algorithm":[92,125,161,185],"for":[93,126,155,186,194],"$\\frac{1}{2}":[98],"-\u03b5$":[99],"approximation":[100,165],"ratio":[101,166],"query":[104,171],"complexity":[105,172],"bounded":[106],"$\\mathrm{poly}(\\log(n),\\log(k),\u03b5^{-1})$.":[108],"However,":[109],"as":[110],"we":[111,181],"explain":[112],"paper,":[115,180],"analysis":[117],"has":[118],"some":[119],"important":[120,136],"gaps.":[121],"Having":[122],"polylogarithmic":[130,203],"time":[132],"even":[134],"more":[135],"light":[138],"result":[142],"Chen":[144],"Peng":[146],"STOC'22":[148],"who":[149],"show":[150],"matching":[152],"lower":[153],"bound":[154],"--":[158],"any":[159],"randomized":[160],"$\\frac{1}{2}+\u03b5$":[164],"must":[167],"have":[168],"amortized":[170,204],"that":[173,189],"polynomial":[175],"$n$.":[177],"In":[178],"develop":[182],"simpler":[184],"maintains":[190],"$(\\frac{1}{2}-\u03b5)$-approximate":[192],"maximization":[196]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4378474166","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2023-05-27T00:00:00"}
