Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
2204.10465.pdf (Preprint), 746KB
Abboud, A., Bringmann, K., Khoury, S., & Zamir, O. (2022). Hardness of Approximation in p via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond. In S. Leonardi, & A. Gupta (Eds.), STOC '22 (pp. 1487-1500). New York, NY: ACM. doi:10.1145/3519935.3520066.