Tight conditional lower bounds for approximating diameter in directed graphs

DOI10.1145/3406325.3451130arXiv2011.03892OpenAlexW3171428299MaRDI QIDQ6065286

Nicole Wein, Mina Dalirrooyfard

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.03892

zbMATH Keywords

graph algorithmsgraph diameterfine-grained complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Removing additive structure in 3SUM-based reductions

This page was built for publication: Tight conditional lower bounds for approximating diameter in directed graphs