{"id":"https://openalex.org/W2963829849","doi":"https://doi.org/10.1145/3313276.3316327","title":"Unconstrained submodular maximization with constant adaptive complexity","display_name":"Unconstrained submodular maximization with constant adaptive complexity","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2963829849","doi":"https://doi.org/10.1145/3313276.3316327","mag":"2963829849"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316327","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316327","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5005114302","display_name":"Lin Chen","orcid":"https://orcid.org/0000-0003-3909-4916"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lin Chen","raw_affiliation_strings":["Yale University, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"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":["Open University of Israel, Israel"],"affiliations":[{"raw_affiliation_string":"Open University of Israel, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020548562","display_name":"Amin Karbasi","orcid":"https://orcid.org/0000-0002-5898-0289"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amin Karbasi","raw_affiliation_strings":["Yale University, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005114302"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":3.8797,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94219742,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"102","last_page":"113"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9947999715805054,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"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/submodular-set-function","display_name":"Submodular set function","score":0.9574893116950989},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.7212367057800293},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.687536358833313},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6846144199371338},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6060324311256409},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.553542971611023},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5018012523651123},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49701741337776184},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49378618597984314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.445348858833313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34943753480911255}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9574893116950989},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7212367057800293},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.687536358833313},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6846144199371338},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6060324311256409},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.553542971611023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5018012523651123},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49701741337776184},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49378618597984314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.445348858833313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34943753480911255},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3313276.3316327","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316327","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7746946551","display_name":null,"funder_award_id":"1357/16","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1542515633","https://openalex.org/W1542719709","https://openalex.org/W1680189815","https://openalex.org/W1757790940","https://openalex.org/W1816320414","https://openalex.org/W1875482710","https://openalex.org/W1955698431","https://openalex.org/W1997783781","https://openalex.org/W1997959284","https://openalex.org/W2037568170","https://openalex.org/W2038938388","https://openalex.org/W2045492898","https://openalex.org/W2053381548","https://openalex.org/W2061820396","https://openalex.org/W2101246692","https://openalex.org/W2117659259","https://openalex.org/W2132651631","https://openalex.org/W2179494254","https://openalex.org/W2223858906","https://openalex.org/W2250289728","https://openalex.org/W2252172643","https://openalex.org/W2263717697","https://openalex.org/W2402949237","https://openalex.org/W2436982461","https://openalex.org/W2549812467","https://openalex.org/W2560274656","https://openalex.org/W2607105342","https://openalex.org/W2748279627","https://openalex.org/W2752477808","https://openalex.org/W2786588856","https://openalex.org/W2803199317","https://openalex.org/W2809318113","https://openalex.org/W2883816296","https://openalex.org/W2888361222","https://openalex.org/W2900578032","https://openalex.org/W2952024675","https://openalex.org/W2952567852","https://openalex.org/W2953374984","https://openalex.org/W2962795549","https://openalex.org/W2962827663","https://openalex.org/W2962908181","https://openalex.org/W2963259708","https://openalex.org/W2964031111","https://openalex.org/W2990138404","https://openalex.org/W3160905013","https://openalex.org/W4400691701"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4313343266"],"abstract_inverted_index":{"In":[0],"this":[1,16,40,91],"paper,":[2],"we":[3],"consider":[4],"the":[5,12,59,62,71,95],"unconstrained":[6],"submodular":[7],"maximization":[8,72],"problem.":[9],"We":[10],"propose":[11],"first":[13],"algorithm":[14,38,67],"for":[15,39,90],"problem":[17,41,92],"that":[18],"achieves":[19,42,85],"a":[20,29,74,81,86],"tight":[21,87],"(1/2\u2212\u03b5)-approximation":[22,88],"guarantee":[23,89],"using":[24,49],"\u00d5(\u03b5\u22121)":[25],"adaptive":[26,97],"rounds":[27,53],"and":[28,84,98],"linear":[30],"number":[31],"of":[32,54,61,73],"function":[33,78],"evaluations.":[34],"No":[35],"previously":[36],"known":[37],"an":[43],"approximation":[44],"ratio":[45],"better":[46],"than":[47,51],"1/3":[48],"less":[50],"\u03a9(n)":[52],"adaptivity,":[55],"where":[56],"n":[57],"is":[58],"size":[60],"ground":[63],"set.":[64],"Moreover,":[65],"our":[66],"easily":[68],"extends":[69],"to":[70,80],"non-negative":[75],"continuous":[76],"DR-submodular":[77],"subject":[79],"box":[82],"constraint,":[83],"while":[93],"keeping":[94],"same":[96],"query":[99],"complexities.":[100]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}