Karl Bringmann, Marvin Künnemann, Karol Wegrzycki. Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 943-954, ACM, 2019. [doi]
@inproceedings{BringmannKW19,
title = {Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max},
author = {Karl Bringmann and Marvin Künnemann and Karol Wegrzycki},
year = {2019},
doi = {10.1145/3313276.3316373},
url = {https://doi.org/10.1145/3313276.3316373},
researchr = {https://researchr.org/publication/BringmannKW19},
cites = {0},
citedby = {0},
pages = {943-954},
booktitle = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019},
editor = {Moses Charikar and Edith Cohen},
publisher = {ACM},
isbn = {978-1-4503-6705-9},
}