{"id":"https://openalex.org/W3171978723","doi":"https://doi.org/10.1145/3406325.3451045","title":"Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH)","display_name":"Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH)","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3171978723","doi":"https://doi.org/10.1145/3406325.3451045","mag":"3171978723"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451045","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451045","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd 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/A5077120267","display_name":"Ray Li","orcid":"https://orcid.org/0000-0003-3441-2364"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ray Li","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":"https://orcid.org/0000-0003-3441-2364","affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077120267"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":2.0238,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85908184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1684","last_page":"1696"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6098958849906921},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.5534135699272156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5049250721931458},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.47671622037887573},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4559209942817688},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45140916109085083},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4381643533706665},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4349735975265503},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41297051310539246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40972745418548584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3909916579723358},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30493658781051636},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09335839748382568},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09026691317558289},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07517355680465698},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.05760350823402405}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6098958849906921},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.5534135699272156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5049250721931458},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.47671622037887573},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4559209942817688},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45140916109085083},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4381643533706665},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4349735975265503},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41297051310539246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40972745418548584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3909916579723358},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30493658781051636},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09335839748382568},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09026691317558289},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07517355680465698},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.05760350823402405},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451045","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451045","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306079","display_name":"David and Lucile Packard Foundation","ror":"https://ror.org/032atxq54"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W55887128","https://openalex.org/W127322189","https://openalex.org/W147275194","https://openalex.org/W1499541096","https://openalex.org/W1937494301","https://openalex.org/W1969573308","https://openalex.org/W1988067232","https://openalex.org/W1995725694","https://openalex.org/W2000303018","https://openalex.org/W2024502228","https://openalex.org/W2047489708","https://openalex.org/W2064790310","https://openalex.org/W2065105907","https://openalex.org/W2067431706","https://openalex.org/W2084732238","https://openalex.org/W2085630237","https://openalex.org/W2091612923","https://openalex.org/W2112090702","https://openalex.org/W2120248756","https://openalex.org/W2123868336","https://openalex.org/W2151827175","https://openalex.org/W2294619171","https://openalex.org/W2605960096","https://openalex.org/W2735449077","https://openalex.org/W2781953983","https://openalex.org/W2803761918","https://openalex.org/W2940540166","https://openalex.org/W2941010236","https://openalex.org/W2945481216","https://openalex.org/W2957560463","https://openalex.org/W2962831827","https://openalex.org/W2992340601","https://openalex.org/W2996098186","https://openalex.org/W3000811701","https://openalex.org/W3011484032","https://openalex.org/W3100522204","https://openalex.org/W3105033568","https://openalex.org/W3117881093","https://openalex.org/W4210631930","https://openalex.org/W4214773521","https://openalex.org/W4230677477","https://openalex.org/W4231553787","https://openalex.org/W4243936346","https://openalex.org/W4248776151","https://openalex.org/W4300112733","https://openalex.org/W6733954598","https://openalex.org/W6735519211"],"related_works":["https://openalex.org/W2964179321","https://openalex.org/W4293399083","https://openalex.org/W977514099","https://openalex.org/W2214934461","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0],"prove":[1,18],"several":[2],"tight":[3],"results":[4],"on":[5],"the":[6,11,24,38,78],"fine-grained":[7],"complexity":[8],"of":[9,13,40,71,80],"approximating":[10],"diameter":[12],"a":[14,41,53,66,69],"graph.":[15],"First,":[16],"we":[17],"that,":[19],"for":[20,37,59,77],"any":[21],"\u03b5>0,":[22],"assuming":[23],"Strong":[25],"Exponential":[26],"Time":[27],"Hypothesis":[28],"(SETH),":[29],"there":[30],"are":[31],"no":[32],"near-linear":[33,55],"time":[34,56],"2\u2212\u03b5-approximation":[35],"algorithms":[36],"Diameter":[39,60],"sparse":[42],"directed":[43,81],"graph,":[44],"even":[45],"in":[46],"unweighted":[47],"graphs.":[48,82],"This":[49],"result":[50],"shows":[51],"that":[52],"simple":[54],"2-approximation":[57],"algorithm":[58],"is":[61],"optimal":[62],"under":[63],"SETH,":[64],"answering":[65],"question":[67],"from":[68],"survey":[70],"Rubinstein":[72],"and":[73],"Vassilevska-Williams":[74],"(SIGACT":[75],"\u201919)":[76],"case":[79]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}