{"id":"https://openalex.org/W4298012012","doi":"https://doi.org/10.48550/arxiv.1804.05379","title":"Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time","display_name":"Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time","publication_year":2018,"publication_date":"2018-04-15","ids":{"openalex":"https://openalex.org/W4298012012","doi":"https://doi.org/10.48550/arxiv.1804.05379"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1804.05379","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.05379","pdf_url":"https://arxiv.org/pdf/1804.05379","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"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1804.05379","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025907388","display_name":"Alina Raluca Ene","orcid":"https://orcid.org/0000-0002-5818-1807","observed_orcids":["https://orcid.org/0000-0002-5818-1807"]},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ene, Alina","raw_affiliation_strings":["Department of Computer Science , Boston University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Boston University ,","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102936404","display_name":"Huy L\u00ea Nguy\u1ec5n","orcid":"https://orcid.org/0000-0001-5128-6545","observed_orcids":["https://orcid.org/0000-0001-5128-6545"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen, Huy L.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"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.9496999979019165,"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.9496999979019165,"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.010400000028312206,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.0032999999821186066,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-maximization","display_name":"submodular maximization","score":0.9829999804496765},{"id":"https://openalex.org/keywords/monotone-submodular-functions","display_name":"monotone submodular functions","score":0.9449999928474426},{"id":"https://openalex.org/keywords/cardinality-constraints","display_name":"cardinality constraints","score":0.8920000195503235},{"id":"https://openalex.org/keywords/adaptivity","display_name":"adaptivity","score":0.8320000171661377},{"id":"https://openalex.org/keywords/approximation-guarantees","display_name":"approximation guarantees","score":0.7210000157356262},{"id":"https://openalex.org/keywords/nearly-linear-time-algorithms","display_name":"near-linear time algorithms","score":0.7450000047683716},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6129999756813049}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7474133968353271},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7122836112976074},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6888458728790283},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.6720267534255981},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6694823503494263},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6306326985359192},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5717509388923645},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5595650672912598},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5249578952789307},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5175861120223999},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4977741539478302},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4951094686985016},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4783836603164673},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.44172897934913635},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43914666771888733},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4252142906188965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42505043745040894},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41948843002319336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38472387194633484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3501986861228943},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded 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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:1804.05379","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.05379","pdf_url":"https://arxiv.org/pdf/1804.05379","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.1804.05379","doi":"https://doi.org/10.48550/arxiv.1804.05379","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1804.05379","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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1804.05379","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.05379","pdf_url":"https://arxiv.org/pdf/1804.05379","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":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1678081061","display_name":"CAREER: Faster and Smaller Sketches for Bigger Data","funder_award_id":"1750716","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G410645175","display_name":"AF:Small: Continuous Perspectives on Accelerated Methods for Combinatorial Optimization","funder_award_id":"1718342","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8193185572","display_name":"CAREER: New Algorithms for Submodular Optimization","funder_award_id":"1750333","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4321600307","https://openalex.org/W4251076636","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4313343266","https://openalex.org/W4299354108","https://openalex.org/W2113270940"],"abstract_inverted_index":{"In":[0,104],"this":[1,105],"paper,":[2],"we":[3,107],"study":[4],"the":[5,8,14,33,43,47,53,70,83,109,138],"tradeoff":[6],"between":[7],"approximation":[9,98,120],"guarantee":[10],"and":[11,77,133],"adaptivity":[12,28,81],"for":[13],"problem":[15],"of":[16,29,35,38,46,102,126,130,137],"maximizing":[17],"a":[18,24,91,114],"monotone":[19],"submodular":[20],"function":[21,72,131],"subject":[22],"to":[23,42,57],"cardinality":[25],"constraint.":[26],"The":[27,128],"an":[30,64],"algorithm":[31,54,111,139],"is":[32,55,63,73,82],"number":[34,129],"sequential":[36],"rounds":[37,101,125],"queries":[39],"it":[40],"makes":[41],"evaluation":[44],"oracle":[45],"function,":[48],"where":[49,69,80],"in":[50,67,78],"every":[51],"round":[52],"allowed":[56],"make":[58],"polynomially-many":[59],"parallel":[60],"queries.":[61],"Adaptivity":[62],"important":[65],"consideration":[66],"settings":[68],"objective":[71],"estimated":[74],"using":[75,121],"samples":[76],"applications":[79],"main":[84],"running":[85,135],"time":[86,136],"bottleneck.":[87],"Previous":[88],"algorithms":[89],"achieving":[90],"nearly-optimal":[92],"$1":[93,115],"-":[94,96,116,118],"1/e":[95,117],"\u03b5$":[97,119],"require":[99],"$\u03a9(n)$":[100],"adaptivity.":[103,127],"work,":[106],"give":[108],"first":[110],"that":[112],"achieves":[113],"$O(\\ln{n}":[122],"/":[123],"\u03b5^2)$":[124],"evaluations":[132],"additional":[134],"are":[140],"$O(n":[141],"\\mathrm{poly}(\\log{n},":[142],"1/\u03b5))$.":[143]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-10-17T09:40:24.721904","created_date":"2025-10-10T00:00:00"}