{"id":"https://openalex.org/W3100522204","doi":"https://doi.org/10.1145/3406325.3451130","title":"Tight conditional lower bounds for approximating diameter in directed graphs","display_name":"Tight conditional lower bounds for approximating diameter in directed graphs","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3100522204","doi":"https://doi.org/10.1145/3406325.3451130","mag":"3100522204"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451130","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451130","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451130","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451130","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008456648","display_name":"Mina Dalirrooyfard","orcid":"https://orcid.org/0000-0002-7797-3690"},"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":"Mina Dalirrooyfard","raw_affiliation_strings":["Massachusetts Institute of Technology, USA","Massachusetts Institute Of Technology#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute Of Technology#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091698334","display_name":"Nicole Wein","orcid":"https://orcid.org/0000-0003-2792-2374"},"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":"Nicole Wein","raw_affiliation_strings":["Massachusetts Institute of Technology, USA","Massachusetts Institute Of Technology#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute Of Technology#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.8174,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61498605,"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":"1697","last_page":"1710"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7049216628074646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6757503747940063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5862815976142883},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5790666341781616},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45334410667419434},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4435427486896515},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38301098346710205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3587700128555298},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0732620358467102}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7049216628074646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6757503747940063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5862815976142883},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5790666341781616},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45334410667419434},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4435427486896515},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38301098346710205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3587700128555298},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0732620358467102}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3406325.3451130","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451130","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451130","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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"},{"id":"pmh:oai:arXiv.org:2011.03892","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2011.03892","pdf_url":"https://arxiv.org/pdf/2011.03892","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:3100522204","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2011.03892.pdf","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":"pmh:oai:dspace.mit.edu:1721.1/146006","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146006","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"doi:10.48550/arxiv.2011.03892","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2011.03892","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/3406325.3451130","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451130","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451130","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2520504021","display_name":"AF: Small:  Average-Case Fine-Grained Complexity","funder_award_id":"1909429","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5610448148","display_name":"AF: Medium: Collaborative Research: Hardness in Polynomial Time","funder_award_id":"1740519","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8734516770","display_name":"AF: Medium: Collaborative Research: Hardness in Polynomial Time","funder_award_id":"1514339","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3100522204.pdf","grobid_xml":"https://content.openalex.org/works/W3100522204.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W94873848","https://openalex.org/W127322189","https://openalex.org/W147275194","https://openalex.org/W1582638066","https://openalex.org/W1969573308","https://openalex.org/W1988067232","https://openalex.org/W1995725694","https://openalex.org/W2034050320","https://openalex.org/W2047489708","https://openalex.org/W2049500052","https://openalex.org/W2058426370","https://openalex.org/W2064790310","https://openalex.org/W2065105907","https://openalex.org/W2084732238","https://openalex.org/W2143813994","https://openalex.org/W2151827175","https://openalex.org/W2250978763","https://openalex.org/W2254388006","https://openalex.org/W2293041988","https://openalex.org/W2588376819","https://openalex.org/W2795836503","https://openalex.org/W2803761918","https://openalex.org/W2940540166","https://openalex.org/W2962831827","https://openalex.org/W2963017524","https://openalex.org/W2971800005","https://openalex.org/W2992340601","https://openalex.org/W3046430097","https://openalex.org/W3081186877","https://openalex.org/W3082065664","https://openalex.org/W3095198661","https://openalex.org/W3105033568","https://openalex.org/W4214773521","https://openalex.org/W4230677477","https://openalex.org/W4256354285"],"related_works":["https://openalex.org/W3171978723","https://openalex.org/W2803761918","https://openalex.org/W2250978763","https://openalex.org/W2047489708","https://openalex.org/W3017555096","https://openalex.org/W2964445919","https://openalex.org/W2254388006","https://openalex.org/W2962933030","https://openalex.org/W1917184511","https://openalex.org/W2963513631","https://openalex.org/W2963365235","https://openalex.org/W3104625252","https://openalex.org/W3038718897","https://openalex.org/W2794380282","https://openalex.org/W1489272444","https://openalex.org/W2022490362","https://openalex.org/W2049609719","https://openalex.org/W2980994391","https://openalex.org/W2539516785","https://openalex.org/W2964301480"],"abstract_inverted_index":{"Among":[0],"the":[1,7,9,21,33],"most":[2],"fundamental":[3],"graph":[4,25],"parameters":[5],"is":[6],"Diameter,":[8],"largest":[10],"distance":[11],"between":[12],"any":[13],"pair":[14],"of":[15,23],"vertices":[16],"in":[17],"a":[18,24],"graph.":[19],"Computing":[20],"Diameter":[22,52],"with":[26],"m":[27],"edges":[28],"requires":[29],"m2\u2212o(1)":[30],"time":[31],"under":[32],"Strong":[34],"Exponential":[35],"Time":[36],"Hypothesis":[37],"(SETH),":[38],"which":[39],"can":[40],"be":[41],"prohibitive":[42],"for":[43,51],"very":[44],"large":[45],"graphs,":[46],"so":[47],"efficient":[48],"approximation":[49],"algorithms":[50],"are":[53],"desired.":[54]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}