Improved SETH-hardness of unweighted Diameter
share
We prove that, assuming the Strong Exponential Time Hypothesis, for any δ>0, a 5/3-δ approximation of the diameter of an undirected unweighted graph with n vertices needs n^3/2-o(1) time. This result improves on lower bounds of Backurs, Roditty, Segal, Vassilevska-Williams, and Wein.
READ FULL TEXT