Hardness of Approximate Diameter: Now for Undirected Graphs

Author(s)
Dalirrooyfard, Mina; Li, Ray; Williams, Virginia Vassilevska
Thumbnail
DownloadSubmitted version (1.099Mb)
Open Access Policy
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Date issued
2022-02
URI
https://hdl.handle.net/1721.1/143944
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
Publisher
IEEE
Citation
Dalirrooyfard, Mina, Li, Ray and Williams, Virginia Vassilevska. 2022. "Hardness of Approximate Diameter: Now for Undirected Graphs." 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).
Version: Original manuscript
Collections