Before revision: We prove that , assuming the Strong Exponential Time Hypothesis , for any \delta>0, a 5/3-\delta approximation of the diameter of an undirected unweighted graph with nvertices needs n ^{ 3/2-o(1) time.
After revision: We prove that , assuming the Strong Exponential Time Hypothesis , for any \delta>0, a 5/3-\delta approximation of the diameter of an undirected unweighted graph with nvertices needs n ^{ time.