{"id":"https://openalex.org/W3035296211","doi":"https://doi.org/10.1145/3357713.3384310","title":"New hardness results for planar graph problems in p and an algorithm for sparsest cut","display_name":"New hardness results for planar graph problems in p and an algorithm for sparsest cut","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035296211","doi":"https://doi.org/10.1145/3357713.3384310","mag":"3035296211"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384310","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384310","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/A5051832024","display_name":"Amir Abboud","orcid":"https://orcid.org/0000-0002-0502-4517"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amir Abboud","raw_affiliation_strings":["IBM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM, USA","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["CNRS, France / UPMC, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, France / UPMC, France","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip N. Klein","raw_affiliation_strings":["Brown University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, USA","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"996","last_page":"1009"},"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.9994000196456909,"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.9994000196456909,"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.989300012588501,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9889000058174133,"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/combinatorics","display_name":"Combinatorics","score":0.6632903218269348},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6492629051208496},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6376737356185913},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5820249915122986},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5789213180541992},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5608521699905396},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5495549440383911},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5492895841598511},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46350592374801636},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4512854218482971},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44513779878616333},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4251774847507477},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42194536328315735},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35352522134780884},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3283121585845947},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20497527718544006}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6632903218269348},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6492629051208496},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6376737356185913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5820249915122986},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5789213180541992},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5608521699905396},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5495549440383911},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5492895841598511},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46350592374801636},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4512854218482971},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44513779878616333},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4251774847507477},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42194536328315735},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35352522134780884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3283121585845947},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20497527718544006},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384310","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384310","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":[{"id":"https://openalex.org/G2723736142","display_name":"Foundations of Clustering Algorithms","funder_award_id":"ANR-18-CE40-0004","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":70,"referenced_works":["https://openalex.org/W108464071","https://openalex.org/W1430582609","https://openalex.org/W1570735312","https://openalex.org/W1660264423","https://openalex.org/W1736726159","https://openalex.org/W1756958793","https://openalex.org/W1945440063","https://openalex.org/W1969834826","https://openalex.org/W1972676371","https://openalex.org/W1984090926","https://openalex.org/W1984627834","https://openalex.org/W1988593903","https://openalex.org/W1999917965","https://openalex.org/W2018419361","https://openalex.org/W2024654848","https://openalex.org/W2027029507","https://openalex.org/W2029282358","https://openalex.org/W2038643780","https://openalex.org/W2043522657","https://openalex.org/W2047489708","https://openalex.org/W2055693471","https://openalex.org/W2067176532","https://openalex.org/W2067298033","https://openalex.org/W2070486524","https://openalex.org/W2083323175","https://openalex.org/W2084732238","https://openalex.org/W2088844265","https://openalex.org/W2097809727","https://openalex.org/W2115788583","https://openalex.org/W2125690626","https://openalex.org/W2132987209","https://openalex.org/W2141807666","https://openalex.org/W2146507303","https://openalex.org/W2150123893","https://openalex.org/W2152195131","https://openalex.org/W2153715991","https://openalex.org/W2165879774","https://openalex.org/W2256374442","https://openalex.org/W2292193262","https://openalex.org/W2484918492","https://openalex.org/W2493557058","https://openalex.org/W2570172216","https://openalex.org/W2592514830","https://openalex.org/W2598966460","https://openalex.org/W2613923799","https://openalex.org/W2769608535","https://openalex.org/W2793058913","https://openalex.org/W2803418903","https://openalex.org/W2808759691","https://openalex.org/W2892948282","https://openalex.org/W2951760736","https://openalex.org/W2962711627","https://openalex.org/W2962991864","https://openalex.org/W2963123599","https://openalex.org/W2963737091","https://openalex.org/W2964055350","https://openalex.org/W2999484166","https://openalex.org/W3099570205","https://openalex.org/W3101294093","https://openalex.org/W3101346938","https://openalex.org/W3104014862","https://openalex.org/W3105423563","https://openalex.org/W3125825223","https://openalex.org/W4213009331","https://openalex.org/W4235809492","https://openalex.org/W4243936346","https://openalex.org/W4254419859","https://openalex.org/W4300885461","https://openalex.org/W6656636783","https://openalex.org/W6762964322"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W159504299","https://openalex.org/W2096382750","https://openalex.org/W2094388041","https://openalex.org/W2905360057","https://openalex.org/W3102280101"],"abstract_inverted_index":{"The":[0],"Sparsest":[1,80],"Cut":[2,81],"is":[3,18,72,138,236,283,298],"a":[4,37,113,170,182,237,272],"fundamental":[5],"optimization":[6],"problem":[7,17,186,206],"that":[8,96,134,215,240],"have":[9],"been":[10],"extensively":[11],"studied.":[12],"For":[13],"planar":[14,84,184,208,249,284],"inputs":[15],"the":[16,42,48,91,102,108,120,156,176,203,216,231,243,260,268,275,280,299,305,311],"in":[19,25,57,62,83,101,115,126,187,207,226,247,274,304],"P":[20],"and":[21,51,129,163,210,285,308,320,328],"can":[22,52],"be":[23,224],"solved":[24],"\u00d5(n":[26,63,151,157],"3":[27,158],")":[28,65,76,153,159],"time":[29,59,66,104,128,150],"if":[30],"all":[31,286],"vertex":[32,88],"weights":[33],"are":[34,99,288],"1.":[35],"Despite":[36],"significant":[38],"amount":[39],"of":[40,124,161,202,233,245,262,271,318],"effort,":[41],"best":[43],"algorithms":[44],"date":[45],"back":[46],"to":[47,213,266],"early":[49],"90\u2019s":[50],"only":[53],"achieve":[54],"O(log":[55],"n)-approximation":[56],"\u00d5(n)":[58],"or":[60],"3.5-approximation":[61],"2":[64],"[Rao,":[67],"STOC92].":[68],"Our":[69,166],"main":[70],"result":[71,123],"an":[73,145,253],"\u03a9(n":[74],"2\u2212\u03b5":[75],"lower":[77,109,136,167,179,196,257,302],"bound":[78,137,168,180,258,303],"for":[79,181,200,220,324,329],"even":[82,278],"graphs":[85],"with":[86,148],"unit":[87],"weights,":[89],"under":[90,198],"(min,":[92],"+)-Convolution":[93],"conjecture,":[94],"showing":[95],"approxima-":[97],"tions":[98],"inevitable":[100],"near-linear":[103,116],"regime.":[105],"To":[106],"complement":[107],"bound,":[110],"we":[111,193],"provide":[112],"3.3-approximation":[114],"time,":[117],"improving":[118,154],"upon":[119,155],"25-year":[121],"old":[122],"Rao":[125],"both":[127],"accuracy.":[130],"We":[131,251],"also":[132,241],"show":[133,214],"our":[135,191,234],"not":[139],"far":[140],"from":[141,294],"optimal":[142],"by":[143,174],"observing":[144],"exact":[146],"algorithm":[147,160],"running":[149],"5/2":[152],"Park":[162],"Phillips":[164],"[STOC93].":[165],"accomplishes":[169],"repeatedly":[171],"raised":[172],"challenge":[173],"being":[175],"first":[177,300],"fine-grained":[178],"natural":[183],"graph":[185,282],"P.":[188],"Building":[189],"on":[190,259],"construction":[192],"prove":[194,252],"near-quadratic":[195],"bounds":[197,317],"SETH":[199],"variants":[201],"closest":[204],"pair":[205],"graphs,":[209],"use":[211],"them":[212],"popular":[217],"Average-Linkage":[218],"procedure":[219],"Hierarchical":[221],"Clustering":[222],"cannot":[223],"simulated":[225],"truly":[227],"subquadratic":[228],"time.":[229],"At":[230],"core":[232],"constructions":[235],"diamond-like":[238],"gadget":[239],"settles":[242],"complexity":[244],"Diameter":[246],"distributed":[248],"networks.":[250],"\u03a9(n/":[254],"log":[255,314],"n)":[256,315],"number":[261],"communication":[263],"rounds":[264],"required":[265],"compute":[267],"weighted":[269,334],"diameter":[270,327],"network":[273],"CONGET":[276],"model,":[277],"when":[279],"underlying":[281],"nodes":[287],"D":[289],"=":[290],"4":[291],"hops":[292],"away":[293],"each":[295],"other.":[296],"This":[297],"poly(n)":[301],"planar-distributed":[306],"setting,":[307],"it":[309],"complements":[310],"recent":[312],"poly(D,":[313],"upper":[316],"Li":[319],"Parter":[321],"[STOC":[322],"2019]":[323],"(exact)":[325],"unweighted":[326],"(1":[330],"+":[331],"\u03b5)":[332],"approximate":[333],"diameter.":[335]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}