A note on hardness of diameter approximation
Information Processing Letters, 2018, 133: 10-15.
We revisit the hardness of approximating the diameter of a network. In the CONGEST model of distributed computing, (Omega) over tilde (n) rounds are necessary to compute the diameter (Frischknecht et al., 2012 ), where (Omega) over tilde(center dot) hides polylogarithmic factors. Abboud et al. (2016)  extended this result to sparse graphs and, at a more fine-grained level, showed that, for any integer 1
Distributed computing; Lower bounds; Hardness in P; Graph algorithms