{"id":"https://openalex.org/W3160905013","doi":"https://doi.org/10.1145/3184990","title":"Deterministic Algorithms for Submodular Maximization Problems","display_name":"Deterministic Algorithms for Submodular Maximization Problems","publication_year":2018,"publication_date":"2018-06-16","ids":{"openalex":"https://openalex.org/W3160905013","doi":"https://doi.org/10.1145/3184990","mag":"3160905013"},"language":"en","primary_location":{"id":"doi:10.1145/3184990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3184990","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":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/261923","any_repository_has_fulltext":true},"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, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077772086","display_name":"Moran Feldman","orcid":"https://orcid.org/0000-0002-1535-2979"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Moran Feldman","raw_affiliation_strings":["EPFL, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-1535-2979","affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002590915"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":3.8686,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.94658408,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"1","last_page":"20"},"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.9998999834060669,"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.9998999834060669,"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.9944999814033508,"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.9943000078201294,"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.9569395780563354},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6981972455978394},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.563589334487915},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5543974041938782},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.529189944267273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5278850793838501},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4979887008666992},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4603419601917267},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.44590747356414795},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4457972049713135},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4438869059085846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42522549629211426},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.0832955539226532}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9569395780563354},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6981972455978394},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.563589334487915},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5543974041938782},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.529189944267273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5278850793838501},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4979887008666992},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4603419601917267},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44590747356414795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4457972049713135},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4438869059085846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42522549629211426},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0832955539226532},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3184990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3184990","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"},{"id":"pmh:oai:infoscience.epfl.ch:261923","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/261923","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:261923","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/261923","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W45588701","https://openalex.org/W1509940100","https://openalex.org/W1542719709","https://openalex.org/W1816320414","https://openalex.org/W1955698431","https://openalex.org/W1973315504","https://openalex.org/W1985123706","https://openalex.org/W1998735557","https://openalex.org/W1999032440","https://openalex.org/W2000444555","https://openalex.org/W2035337032","https://openalex.org/W2038938388","https://openalex.org/W2045492898","https://openalex.org/W2049451257","https://openalex.org/W2053381548","https://openalex.org/W2054428995","https://openalex.org/W2064933851","https://openalex.org/W2067883080","https://openalex.org/W2087038607","https://openalex.org/W2109309418","https://openalex.org/W2126307323","https://openalex.org/W2132651631","https://openalex.org/W2146489710","https://openalex.org/W2158760370","https://openalex.org/W2179494254","https://openalex.org/W2223858906","https://openalex.org/W2263717697","https://openalex.org/W4255529553"],"related_works":["https://openalex.org/W4205152933","https://openalex.org/W2963922672","https://openalex.org/W2237447357","https://openalex.org/W2964314169","https://openalex.org/W4321600307","https://openalex.org/W2735578456","https://openalex.org/W2963829849","https://openalex.org/W4293997817","https://openalex.org/W2949076628","https://openalex.org/W1955698431"],"abstract_inverted_index":{"Randomization":[0],"is":[1,76,105,108,124,148,217],"a":[2,79,133,152,175,194,199],"fundamental":[3,100],"tool":[4],"used":[5],"in":[6,22,37,102],"many":[7],"theoretical":[8],"and":[9,36,161,191],"practical":[10],"areas":[11],"of":[12,20,25,61,138,158,174],"computer":[13],"science.":[14],"We":[15,179],"study":[16],"here":[17],"the":[18,23,41,52,71,74,156,159],"role":[19],"randomization":[21,107,123,216],"area":[24,104],"submodular":[26,65,141,189,195,206],"function":[27,66,75,142,196],"maximization.":[28,143],"In":[29,116,202],"this":[30,103,117,224],"area,":[31],"most":[32],"algorithms":[33,48,62,130,139,186],"are":[34,49],"randomized,":[35],"almost":[38],"all":[39],"cases":[40],"approximation":[42,114],"ratios":[43],"obtained":[44,55,168],"by":[45,56,131],"current":[46],"randomized":[47],"superior":[50],"to":[51,73,88,149,198],"best":[53],"results":[54,222],"known":[57],"deterministic":[58,212],"algorithms.":[59],"Derandomization":[60],"for":[63,86,111,127,136,140,187,192,204,219,223],"general":[64],"maximization":[67,190,207],"seems":[68],"hard":[69],"since":[70],"access":[72],"done":[77],"via":[78],"value":[80],"oracle.":[81],"This":[82],"makes":[83],"it":[84,164],"hard,":[85],"example,":[87],"apply":[89],"standard":[90],"derandomization":[91,137],"techniques":[92],"such":[93],"as":[94],"conditional":[95],"expectations.":[96],"Therefore,":[97],"an":[98,170,210],"interesting":[99],"problem":[101],"whether":[106],"inherently":[109],"necessary":[110,126],"obtaining":[112,128,220],"good":[113,129],"ratios.":[115],"work,":[118],"we":[119,208],"give":[120],"evidence":[121],"that":[122,215],"not":[125],"presenting":[132],"new":[134],"technique":[135,182],"Our":[144],"high":[145],"level":[146],"idea":[147],"maintain":[150],"explicitly":[151],"(small)":[153],"distribution":[154],"over":[155],"states":[157],"algorithm,":[160],"carefully":[162],"update":[163],"using":[165],"marginal":[166],"values":[167],"from":[169],"extreme":[171],"point":[172],"solution":[173],"suitable":[176],"linear":[177],"formulation.":[178],"demonstrate":[180],"our":[181],"on":[183],"two":[184],"recent":[185],"unconstrained":[188,205],"maximizing":[193],"subject":[197],"cardinality":[200],"constraint.":[201],"particular,":[203],"obtain":[209],"optimal":[211,221],"1/2-approximation":[213],"showing":[214],"unnecessary":[218],"setting.":[225]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4}],"updated_date":"2026-05-27T09:02:27.158192","created_date":"2025-10-10T00:00:00"}