Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max

07/25/2019
by   Karl Bringmann, et al.
0

Zwick's (1+ε)-approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time O(n^ω/εlogW), where ω< 2.373 is the exponent of matrix multiplication and W denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight triangle, and minimum-weight cycle in the same time bound. Since Zwick's algorithm uses the scaling technique, it has a factor log W in the running time. In this paper, we study whether APSP and related problems admit approximation schemes avoiding the scaling technique. That is, the number of arithmetic operations should be independent of W; this is called strongly polynomial. Our main results are as follows. - We design approximation schemes in strongly polynomial time O(n^ω/εpolylog(n/ε)) for APSP on undirected graphs as well as for the graph characteristics diameter, radius, median, minimum-weight triangle, and minimum-weight cycle on directed or undirected graphs. - For APSP on directed graphs we design an approximation scheme in strongly polynomial time O(n^ω + 3/2ε^-1polylog(n/ε)). This is significantly faster than the best exact algorithm. - We explain why our approximation scheme for APSP on directed graphs has a worse exponent than ω: Any improvement over our exponent ω + 3/2 would improve the best known algorithm for Min-Max Product In fact, we prove that approximating directed APSP and exactly computing the Min-Max Product are equivalent.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/16/2023

Approximating Min-Diameter: Standard and Bichromatic

The min-diameter of a directed graph G is a measure of the largest dista...
research
04/07/2020

Approximating Min-Mean-Cycle for low-diameter graphs in near-optimal time and memory

We revisit Min-Mean-Cycle, the classical problem of finding a cycle in a...
research
08/16/2023

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model

Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of m...
research
12/18/2017

No truthful mechanism can be better than n approximate for two natural problems

This work gives the first natural non-utilitarian problems for which the...
research
02/11/2021

Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths

APSP with small integer weights in undirected graphs [Seidel'95, Galil a...
research
06/23/2018

Approximating some network problems with scenarios

In this paper the shortest path and the minimum spanning tree problems i...
research
04/17/2021

Approximate Triangle Counting via Sampling and Fast Matrix Multiplication

There is a trivial O(n^3/T) time algorithm for approximate triangle coun...

Please sign up or login with your details

Forgot password? Click here to reset