{"id":"https://openalex.org/W2902154658","doi":"https://doi.org/10.1145/3313276.3316406","title":"Parallelizing greedy for submodular set function maximization in matroids and beyond","display_name":"Parallelizing greedy for submodular set function maximization in matroids and beyond","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2902154658","doi":"https://doi.org/10.1145/3313276.3316406","mag":"2902154658"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316406","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316406","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316406","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":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316406","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, USA","[University of Illinois at Urbana-Champaign,USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"[University of Illinois at Urbana-Champaign,USA]","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019690129","display_name":"Kent Quanrud","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kent Quanrud","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, USA","[University of Illinois at Urbana-Champaign,USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"[University of Illinois at Urbana-Champaign,USA]","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.9387,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.6758978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"78","last_page":"89"},"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.9987000226974487,"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.9987000226974487,"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.9208999872207642,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9036999940872192,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9458345770835876},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9334018230438232},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7053672075271606},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6710368394851685},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6706259846687317},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6065109372138977},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5635555386543274},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5275359153747559},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5139419436454773},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4977259933948517},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.44416093826293945},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3897436261177063},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3707469701766968},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27314287424087524},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2325616180896759},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0832987129688263}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9458345770835876},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9334018230438232},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7053672075271606},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6710368394851685},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6706259846687317},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6065109372138977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5635555386543274},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5275359153747559},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5139419436454773},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4977259933948517},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.44416093826293945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3897436261177063},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3707469701766968},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27314287424087524},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2325616180896759},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0832987129688263},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3313276.3316406","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316406","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316406","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"},{"id":"pmh:oai:arXiv.org:1811.12568","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.12568","pdf_url":"https://arxiv.org/pdf/1811.12568","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,"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":"mag:2902154658","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1811.12568","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,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1811.12568","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1811.12568","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,"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":"doi:10.1145/3313276.3316406","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316406","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316406","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G401424543","display_name":null,"funder_award_id":"CCF-1526799","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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2902154658.pdf","grobid_xml":"https://content.openalex.org/works/W2902154658.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1526762477","https://openalex.org/W1680189815","https://openalex.org/W1975146994","https://openalex.org/W1989151913","https://openalex.org/W1997959284","https://openalex.org/W2045492898","https://openalex.org/W2049451257","https://openalex.org/W2068264871","https://openalex.org/W2087311268","https://openalex.org/W2094067695","https://openalex.org/W2118947995","https://openalex.org/W2132651631","https://openalex.org/W2252172643","https://openalex.org/W2473929617","https://openalex.org/W2569511777","https://openalex.org/W2579645839","https://openalex.org/W2610884651","https://openalex.org/W2757107770","https://openalex.org/W2796716148","https://openalex.org/W2804373447","https://openalex.org/W2809318113","https://openalex.org/W2900404942","https://openalex.org/W2952359104","https://openalex.org/W2952567852","https://openalex.org/W2962908181","https://openalex.org/W2963333531","https://openalex.org/W2964020479","https://openalex.org/W4210445513"],"related_works":["https://openalex.org/W2963059222","https://openalex.org/W2899827320","https://openalex.org/W3092028377","https://openalex.org/W3101270593","https://openalex.org/W3048198878","https://openalex.org/W2797074460","https://openalex.org/W3013568067","https://openalex.org/W2883816296","https://openalex.org/W3041829701","https://openalex.org/W2946234094","https://openalex.org/W2951569895","https://openalex.org/W2952164293","https://openalex.org/W2900404942","https://openalex.org/W3209408294","https://openalex.org/W2900939397","https://openalex.org/W2962811043","https://openalex.org/W2964501918","https://openalex.org/W2751800647","https://openalex.org/W3008516270","https://openalex.org/W2809318113"],"abstract_inverted_index":{"We":[0,94],"consider":[1],"parallel,":[2],"or":[3],"low":[4],"adaptivity,":[5],"algorithms":[6],"for":[7,53,161,166,181],"submodular":[8,56],"function":[9,57],"maximization.":[10,58],"This":[11],"line":[12],"of":[13,46,92,133,168],"work":[14],"was":[15],"recently":[16],"initiated":[17],"by":[18],"Balkanski":[19],"and":[20,22,34,73,99,107,146,170,172],"Singer":[21],"has":[23,50],"already":[24],"led":[25],"to":[26,67,76,105,109,178],"several":[27],"interesting":[28],"results":[29],"on":[30,96],"the":[31,43,69,173],"cardinality":[32],"constraint":[33],"explicit":[35],"packing":[36],"constraints.":[37],"An":[38],"important":[39],"open":[40],"problem":[41],"is":[42],"classical":[44],"setting":[45],"matroid":[47],"constraint,":[48],"which":[49],"been":[51],"instrumental":[52],"developments":[54],"in":[55,85,126],"In":[59],"this":[60,97],"paper":[61],"we":[62,138],"develop":[63],"a":[64,78,111,116,140,147,152],"general":[65],"strategy":[66],"parallelize":[68],"well-studied":[70],"greedy":[71,163],"algorithm":[72],"use":[74],"it":[75],"obtain":[77,110,139],"randomized":[79,118],"(1":[80],"/":[81,88,129,155],"2":[82,89],"\u2212":[83,121,123,143,157],"\u0454)-approximation":[84],"O(":[86,127],"log2(n)":[87,128],")":[90,131],"rounds":[91,132],"adaptivity.":[93,134],"rely":[95],"algorithm,":[98],"an":[100],"elegant":[101],"amplification":[102],"approach":[103,160],"due":[104],"Badanidiyuru":[106],"Vondr\u00e1k":[108],"fractional":[112,148],"solution":[113,149],"that":[114,150],"yields":[115,151,164],"near-optimal":[117],"(":[119,141,153],"1":[120,154],"1/e":[122],"\u0454":[124,144],")-approximation":[125,145],"\u04543":[130],"For":[135],"non-negative":[136],"functions":[137],"3\u22122\u221a2":[142],"e":[156],"\u0454)-approximation.":[158],"Our":[159],"parallelizing":[162],"approximations":[165],"intersections":[167],"matroids":[169],"matchoids,":[171],"approximation":[174],"ratios":[175],"are":[176],"comparable":[177],"those":[179],"known":[180],"sequential":[182],"greedy.":[183]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}