Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond

Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir. Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 1487-1500, ACM, 2022. [doi]

Abstract

Abstract is missing.