Reduction from Triangle Collection* to dynamic 4/3-Diameter

From Algorithm Wiki
Revision as of 09:59, 10 April 2023 by Admin (talk | contribs)
Jump to navigation Jump to search

FROM: Triangle Collection* TO: dynamic 4/3-Diameter

Description

Implications

assume: SETH or {3}SUM Hypothesis or APSP Hypothesis
then: there exists no static ${4}/{3}-\epsilon$ approximation to the diameter on unweighted graphs running in $O((n\sqrt{m})^{1-\epsilon'})$ time for any $\epsilon,\epsilon' > {0}$ and an number of edges $m$

Year

2016

Reference

Dahlgaard, S. (2016). On the hardness of partially dynamic graph problems and connections to diameter. arXiv preprint arXiv:1602.06705.

https://arxiv.org/abs/1602.06705