Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs

Thumbnail Image
Download
Name

3406325.3451130.pdf

Size

1.11 MB

Format

Adobe PDF

Checksum (MD5)

298a6681076718b4817c19cbb528724c

Download all files submitted through automated deposit
3406325.3451130.zip (972.79 KB)
Author(s)
Dalirrooyfard, Mina
•
Wein, Nicole
Date Issued
June 15, 2021
Publisher
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Citation
Dalirrooyfard, Mina and Wein, Nicole. 2021. "Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/146006
DOI of Published Version
https://doi.org/10.1145/3406325.3451130
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.