4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time n^4/3

01/07/2021
by   Édouard Bonnet, et al.
0

We show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0, approximating undirected unweighted Diameter on n-vertex n^1+o(1)-edge graphs within ratio 7/4 - ε requires m^4/3 - o(1) time. This is the first result that conditionally rules out a near-linear time 5/3-approximation for undirected Diameter.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 3

08/26/2020

Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio

We show, assuming the Strong Exponential Time Hypothesis, that for every...
08/12/2020

Improved SETH-hardness of unweighted Diameter

We prove that, assuming the Strong Exponential Time Hypothesis, for any ...
06/10/2021

Hardness of Approximate Diameter: Now for Undirected Graphs

Approximating the graph diameter is a basic task of both theoretical and...
08/10/2018

Greedy Algorithms for Approximating the Diameter of Machine Learning Datasets in Multidimensional Euclidean Space

Finding the diameter of a dataset in multidimensional Euclidean space is...
11/09/2017

Distances in and Layering of a DAG

The diameter of an undirected unweighted graph G=(V,E) is the maximum va...
05/18/2021

On Oriented Diameter of (n, k)-Star Graphs

Assignment of one of the two possible directions to every edge of an und...
11/23/2019

Oriented Diameter of Star Graphs

An orientation of an undirected graph G is an assignment of exactly one...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.