Hardness of Approximate Diameter: Now for Undirected Graphs
Name
2106.06026.pdf
Description
Submitted version
Size
1.1 MB
Format
Adobe PDF
Checksum (MD5)
200deb870ea93eb611f3e28850d73ce6
Author(s)
Dalirrooyfard, Mina
Li, Ray
Williams, Virginia Vassilevska
Date Issued
February 2022
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
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/focs52979.2021.00102
