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

08/26/2020
by   Édouard Bonnet, et al.
0

We show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0, approximating directed Diameter on m-arc graphs within ratio 7/4 - ε requires m^4/3 - o(1) time. Our construction uses nonnegative edge weights but even holds for sparse digraphs, i.e., for which the number of vertices n and the number of arcs m satisfy m = n log^O(1) n. This is the first result that conditionally rules out a near-linear time 5/3-approximation for Diameter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2021

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

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

Improved SETH-hardness of unweighted Diameter

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

Hardness of Approximate Diameter: Now for Undirected Graphs

Approximating the graph diameter is a basic task of both theoretical and...
research
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...
research
11/15/2021

On Circuit Diameter Bounds via Circuit Imbalances

We study the circuit diameter of polyhedra, introduced by Borgwardt, Fin...
research
05/27/2023

Finding Diameter-Reducing Shortcuts in Trees

In the k-Diameter-Optimally Augmenting Tree Problem we are given a tree ...
research
06/19/2022

Frank-Wolfe-based Algorithms for Approximating Tyler's M-estimator

Tyler's M-estimator is a well known procedure for robust and heavy-taile...

Please sign up or login with your details

Forgot password? Click here to reset