{"id":"https://openalex.org/W4404417988","doi":"https://doi.org/10.1145/3704631","title":"Hardness of Approximate Diameter: Now for Undirected Graphs","display_name":"Hardness of Approximate Diameter: Now for Undirected Graphs","publication_year":2024,"publication_date":"2024-11-15","ids":{"openalex":"https://openalex.org/W4404417988","doi":"https://doi.org/10.1145/3704631"},"language":"en","primary_location":{"id":"doi:10.1145/3704631","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704631","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3704631","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3704631","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008456648","display_name":"Mina Dalirrooyfard","orcid":"https://orcid.org/0000-0002-7797-3690"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mina Dalirrooyfard","raw_affiliation_strings":["Machine Learning Research, Morgan Stanley Canada, Calgary, Canada"],"raw_orcid":"https://orcid.org/0000-0002-7797-3690","affiliations":[{"raw_affiliation_string":"Machine Learning Research, Morgan Stanley Canada, Calgary, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077120267","display_name":"Ray Li","orcid":"https://orcid.org/0000-0003-3441-2364"},"institutions":[{"id":"https://openalex.org/I16269868","display_name":"Santa Clara University","ror":"https://ror.org/03ypqe447","country_code":"US","type":"education","lineage":["https://openalex.org/I16269868"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ray Li","raw_affiliation_strings":["Mathematics and computer science, Santa Clara University, Santa Clara, United States"],"raw_orcid":"https://orcid.org/0000-0003-3441-2364","affiliations":[{"raw_affiliation_string":"Mathematics and computer science, Santa Clara University, Santa Clara, United States","institution_ids":["https://openalex.org/I16269868"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044244682","display_name":"Virginia Vassilevska Williams","orcid":"https://orcid.org/0000-0003-4844-2863"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Virginia Vassilevska Williams","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, United States"],"raw_orcid":"https://orcid.org/0000-0003-4844-2863","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, United States","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008456648"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2016,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.88358556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"72","issue":"1","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/undirected-graph","display_name":"Undirected graph","score":0.6593884229660034},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6509198546409607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5006344318389893},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44735491275787354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3551406264305115},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24636191129684448}],"concepts":[{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6593884229660034},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6509198546409607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5006344318389893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44735491275787354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3551406264305115},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24636191129684448}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3704631","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704631","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3704631","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3704631","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704631","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3704631","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4404417988.pdf"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W94873848","https://openalex.org/W1571792361","https://openalex.org/W1969573308","https://openalex.org/W1985572324","https://openalex.org/W1988067232","https://openalex.org/W2034050320","https://openalex.org/W2038073775","https://openalex.org/W2047489708","https://openalex.org/W2058426370","https://openalex.org/W2084732238","https://openalex.org/W2120248756","https://openalex.org/W2143813994","https://openalex.org/W2176897270","https://openalex.org/W2294619171","https://openalex.org/W2618199688","https://openalex.org/W2898839814","https://openalex.org/W2992340601","https://openalex.org/W3116253690","https://openalex.org/W3171428299","https://openalex.org/W3171978723","https://openalex.org/W3174842734","https://openalex.org/W4214773521","https://openalex.org/W4230677477","https://openalex.org/W4297795846","https://openalex.org/W4313227178","https://openalex.org/W4390575692"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"Approximating":[0],"the":[1,23,85,116,133,160,165,178,196],"graph":[2],"diameter":[3,24,62,105],"is":[4,43,122,139,184],"a":[5,20,40,68,101,204],"basic":[6],"task":[7],"of":[8,50,148,164],"both":[9],"theoretical":[10],"and":[11,77,79,97,150,155,169,202,206],"practical":[12],"interest.":[13],"A":[14,48],"simple":[15,117,179],"folklore":[16],"algorithm":[17,121,183],"can":[18],"output":[19],"2-approximation":[21,120,182],"to":[22,57,223],"in":[25,45,63,67,106,175,199,219],"linear":[26,118,180],"time":[27,119,181],"by":[28,74],"running":[29],"BFS":[30],"from":[31],"an":[32],"arbitrary":[33],"vertex.":[34],"It":[35],"has":[36],"been":[37],"open":[38],"whether":[39],"better":[41],"approximation":[42,103],"possible":[44,140],"near-linear":[46],"time.":[47,113],"series":[49],"articles":[51],"on":[52],"fine-grained":[53],"complexity":[54],"have":[55],"led":[56],"strong":[58],"hardness":[59,215],"results":[60,147],"for":[61,91,104,124,141,187,212,216],"directed":[64,107,125],"graphs,":[65],"culminating":[66],"recent":[69],"tradeoff":[70,135],"curve":[71,138],"independently":[72],"discovered":[73],"[Li,":[75],"STOC\u201921]":[76],"[Dalirrooyfard":[78],"Wein,":[80],"STOC\u201921],":[81],"showing":[82],"that":[83,132,177,208],"under":[84],"Strong":[86],"Exponential":[87],"Time":[88],"Hypothesis":[89],"(SETH),":[90],"any":[92],"integer":[93],"k":[94,167],"\u2265":[95],"2":[96],"\u03b4":[98],">":[99],"0,":[100],"\\(2-\\frac{1}{k}-\\delta\\)":[102],"m":[108],"-edge":[109],"graphs":[110,143,221],"requires":[111],"\\(m^{1+1/(k-1)-o(1)}\\)":[112],"In":[114,127],"particular,":[115],"optimal":[123,186],"graphs.":[126,189],"this":[128],"article,":[129],"we":[130,194],"prove":[131],"same":[134],"lower":[136],"bound":[137],"undirected":[142,188,220],"as":[144],"well,":[145],"extending":[146],"[Roditty":[149],"Vassilevska":[151],"W.,":[152],"STOC\u201913],":[153],"[Li\u201920]":[154],"[Bonnet,":[156],"ICALP\u201921]":[157],"who":[158],"proved":[159],"first":[161],"few":[162],"cases":[163],"curve,":[166],"=2,3,":[168],"4,":[170],"respectively.":[171],"Our":[172],"result":[173],"shows":[174],"particular":[176],"conditionally":[185],"To":[190],"obtain":[191],"our":[192],"result,":[193],"extract":[195],"core":[197],"ideas":[198],"known":[200],"reductions":[201],"introduce":[203],"unification":[205],"generalization":[207],"could":[209],"be":[210],"useful":[211],"proving":[213],"SETH-based":[214],"other":[217],"problems":[218],"related":[222],"distance":[224],"computation.":[225]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}