Affiliation:
1. Université Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, Lyon, France
Abstract
We show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0, approximating undirected unweighted
Diameter
on
n
-vertex
m
-edge graphs within ratio 7/4 - ε requires
m
4/3 -
o
(1)
time, even when
m
= Õ(
n
). This is the first result that conditionally rules out a near-linear time 5/3-approximation for undirected
Diameter
.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Hardness of Approximate Diameter: Now for Undirected Graphs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02