Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Künnemann, Marvin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
arXiv:1907.11078.pdf (Preprint), 481KB
Bringmann, K., Künnemann, M., & Węgrzycki, K. (2019). Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. Retrieved from http://arxiv.org/abs/1907.11078.