{"id":"https://openalex.org/W3034847651","doi":"https://doi.org/10.1145/3357713.3384287","title":"A lower bound for parallel submodular minimization","display_name":"A lower bound for parallel submodular minimization","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3034847651","doi":"https://doi.org/10.1145/3357713.3384287","mag":"3034847651"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384287","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5067293707","display_name":"Eric Balkanski","orcid":"https://orcid.org/0000-0001-6876-7919"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Balkanski","raw_affiliation_strings":["Harvard University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050591232","display_name":"Yaron Singer","orcid":"https://orcid.org/0000-0001-6811-9102"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yaron Singer","raw_affiliation_strings":["Harvard University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, USA","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":null,"apc_paid":null,"fwci":2.3566,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88388066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"130","last_page":"139"},"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.9958999752998352,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9957000017166138,"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/submodular-set-function","display_name":"Submodular set function","score":0.9726019501686096},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.7736501693725586},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.7127262353897095},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5162779688835144},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5148016810417175},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.476068913936615},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4608864486217499},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4161120355129242},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3862406611442566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3124197721481323},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3011813759803772}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9726019501686096},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7736501693725586},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.7127262353897095},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5162779688835144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5148016810417175},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.476068913936615},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4608864486217499},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4161120355129242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3862406611442566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3124197721481323},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3011813759803772},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384287","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1498671329","https://openalex.org/W2007111443","https://openalex.org/W2012329067","https://openalex.org/W2015429465","https://openalex.org/W2022049946","https://openalex.org/W2035575256","https://openalex.org/W2061958803","https://openalex.org/W2100440346","https://openalex.org/W2128059732","https://openalex.org/W2130672276","https://openalex.org/W2133374323","https://openalex.org/W2134220221","https://openalex.org/W2143516773","https://openalex.org/W2148391549","https://openalex.org/W2172790076","https://openalex.org/W2401608360","https://openalex.org/W2482182218","https://openalex.org/W2547846601","https://openalex.org/W2585238812","https://openalex.org/W2751618681","https://openalex.org/W2807548807","https://openalex.org/W2809318113","https://openalex.org/W2883693373","https://openalex.org/W2883816296","https://openalex.org/W2949731556","https://openalex.org/W2953264324","https://openalex.org/W2953374984","https://openalex.org/W2962720772","https://openalex.org/W2962760143","https://openalex.org/W2962877742","https://openalex.org/W2963059222","https://openalex.org/W2963115142","https://openalex.org/W2963268806","https://openalex.org/W2963298316","https://openalex.org/W2963829849","https://openalex.org/W2998300574","https://openalex.org/W3003131245"],"related_works":["https://openalex.org/W4390575969","https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W1971979548","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4252842032","https://openalex.org/W3100139999","https://openalex.org/W2113270940"],"abstract_inverted_index":{"In":[0,59],"this":[1],"paper,":[2],"we":[3],"study":[4],"submodular":[5,32,57,93],"function":[6,27],"minimization":[7,33,94],"in":[8],"the":[9,29,54,89],"adaptive":[10],"complexity":[11],"model.":[12],"Seminal":[13],"work":[14,47,62],"by":[15],"Gr'otschel,":[16],"Lov\u00e1sz,":[17],"and":[18],"Schrijver":[19],"shows":[20],"that":[21],"with":[22,38,69],"oracle":[23],"access":[24],"to":[25,41,53,77,91],"a":[26,64],"f,":[28],"problem":[30],"of":[31,46,56],"can":[34,95],"be":[35,96],"solved":[36],"exactly":[37],"poly(n)":[39],"queries":[40],"f.":[42],"A":[43,74],"long":[44],"line":[45],"has":[48],"since":[49],"then":[50],"been":[51],"dedicated":[52],"acceleration":[55],"minimization.":[58],"particular,":[60],"recent":[61],"obtains":[63],"(strongly)":[65],"polynomial":[66],"time":[67],"algorithm":[68],"\u00d5(n":[70],"3)":[71],"query":[72],"complexity.":[73],"natural":[75],"way":[76],"accelerate":[78],"computation":[79],"is":[80,86],"via":[81],"parallelization,":[82],"though":[83],"very":[84],"little":[85],"known":[87],"about":[88],"extent":[90],"which":[92],"parallelized.":[97]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}