{"id":"https://openalex.org/W2950023069","doi":"https://doi.org/10.1145/3309764","title":"Online Submodular Maximization with Preemption","display_name":"Online Submodular Maximization with Preemption","publication_year":2019,"publication_date":"2019-06-07","ids":{"openalex":"https://openalex.org/W2950023069","doi":"https://doi.org/10.1145/3309764","mag":"2950023069"},"language":"en","primary_location":{"id":"doi:10.1145/3309764","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3309764","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["Tel Aviv University, Israel, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077772086","display_name":"Moran Feldman","orcid":"https://orcid.org/0000-0002-1535-2979"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moran Feldman","raw_affiliation_strings":["The Open University of Israel, Raanana, Israel"],"affiliations":[{"raw_affiliation_string":"The Open University of Israel, Raanana, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"last","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"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002590915"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.7459,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.86126612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"3","first_page":"1","last_page":"31"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9961000084877014,"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.9142360687255859},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7807589769363403},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6396241784095764},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6080966591835022},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5834608674049377},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5713623762130737},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.5451395511627197},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.540655791759491},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5087843537330627},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4932371973991394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4813443124294281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4215030074119568},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4031298756599426}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9142360687255859},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7807589769363403},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6396241784095764},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6080966591835022},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5834608674049377},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5713623762130737},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.5451395511627197},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.540655791759491},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5087843537330627},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4932371973991394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4813443124294281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4215030074119568},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4031298756599426},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3309764","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3309764","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W8905951","https://openalex.org/W28813714","https://openalex.org/W45588701","https://openalex.org/W1486950299","https://openalex.org/W1503396090","https://openalex.org/W1514114782","https://openalex.org/W1517928915","https://openalex.org/W1536154726","https://openalex.org/W1542515633","https://openalex.org/W1542719709","https://openalex.org/W1567190796","https://openalex.org/W1576805635","https://openalex.org/W1579140566","https://openalex.org/W1589175915","https://openalex.org/W1674178071","https://openalex.org/W1680189815","https://openalex.org/W1770502437","https://openalex.org/W1825657983","https://openalex.org/W1962684803","https://openalex.org/W1966079129","https://openalex.org/W1973315504","https://openalex.org/W1985123706","https://openalex.org/W1989151913","https://openalex.org/W1997783781","https://openalex.org/W1998735557","https://openalex.org/W1999032440","https://openalex.org/W2000444555","https://openalex.org/W2004546632","https://openalex.org/W2020384210","https://openalex.org/W2036190740","https://openalex.org/W2038938388","https://openalex.org/W2045492898","https://openalex.org/W2053381548","https://openalex.org/W2066898525","https://openalex.org/W2080169294","https://openalex.org/W2080390633","https://openalex.org/W2086937655","https://openalex.org/W2087038607","https://openalex.org/W2104806240","https://openalex.org/W2109039359","https://openalex.org/W2116240509","https://openalex.org/W2126307323","https://openalex.org/W2131824593","https://openalex.org/W2132651631","https://openalex.org/W2133263321","https://openalex.org/W2143996311","https://openalex.org/W2144933361","https://openalex.org/W2145825677","https://openalex.org/W2146489710","https://openalex.org/W2158557760","https://openalex.org/W2158760370","https://openalex.org/W2263717697","https://openalex.org/W2292516383","https://openalex.org/W2401610261","https://openalex.org/W2561675875","https://openalex.org/W2772037640","https://openalex.org/W2952917033","https://openalex.org/W3098705741","https://openalex.org/W4245581944","https://openalex.org/W4255529553","https://openalex.org/W4299553182","https://openalex.org/W4302184630"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W4367393448","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2752015945","https://openalex.org/W3135987664","https://openalex.org/W1493790977","https://openalex.org/W4296167533"],"abstract_inverted_index":{"Submodular":[0],"function":[1,85],"maximization":[2],"has":[3,43,61],"been":[4],"studied":[5],"extensively":[6],"in":[7,21,33,91,125,153],"recent":[8],"years":[9],"under":[10],"various":[11,22],"constraints":[12,50],"and":[13,40,72,103,106,136],"models.":[14],"The":[15,78],"problem":[16,32,102],"plays":[17],"a":[18,26,46,83,116],"major":[19],"role":[20],"disciplines.":[23],"We":[24,94],"study":[25,95],"natural":[27],"online":[28],"variant":[29],"of":[30,56,89,99,133],"this":[31,100],"which":[34,126],"elements":[35,90,152],"arrive":[36],"one":[37,39],"by":[38],"the":[41,59,67,87,92,110,122,127,134,142,145],"algorithm":[42,60,120,128,146],"to":[44,62,65,81],"maintain":[45],"solution":[47,71],"obeying":[48],"certain":[49],"at":[51,149],"all":[52],"times.":[53],"Upon":[54],"arrival":[55],"an":[57],"element,":[58],"decide":[63],"whether":[64],"accept":[66],"element":[68],"into":[69],"its":[70,154],"may":[73,129,147],"preempt":[74],"previously":[75],"chosen":[76],"elements.":[77],"goal":[79],"is":[80],"maximize":[82],"submodular":[84],"over":[86],"set":[88],"solution.":[93,155],"two":[96],"special":[97],"cases":[98],"general":[101],"derive":[104],"upper":[105],"lower":[107],"bounds":[108],"on":[109],"competitive":[111,138],"ratio.":[112],"Specifically,":[113],"we":[114],"design":[115],"1/":[117],"e":[118],"-competitive":[119],"for":[121,141],"unconstrained":[123],"case":[124,143],"hold":[130,148],"any":[131],"subset":[132],"elements,":[135],"constant":[137],"ratio":[139],"algorithms":[140],"where":[144],"most":[150],"k":[151]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}