Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Karl Bringmann; Marvin Künnemann; Karol Węgrzycki

Journal title: STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing

Journal publisher: Association for Computing Machinery

Published year: 2019

DOI identifier: 10.1145/3313276.3316373

ISBN: 978-1-4503-6705-9