# Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

@article{Baswana2010FasterAF, title={Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs}, author={Surender Baswana and Telikepalli Kavitha}, journal={SIAM J. Comput.}, year={2010}, volume={39}, pages={2865-2896} }

Let $G=(V,E)$ be a weighted undirected graph having nonnegative edge weights. An estimate $\hat{\delta}(u,v)$ of the actual distance $\delta(u,v)$ between $u,v\in V$ is said to be of stretch $t$ if and only if $\delta(u,v)\leq\hat{\delta}(u,v)\leq t\cdot\delta(u,v)$. Computing all-pairs small stretch distances efficiently (both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 25 CITATIONS

## Approximate distance oracles with improved preprocessing time

VIEW 8 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Fast Approximate Shortest Paths in the Congested Clique

VIEW 1 EXCERPT

CITES BACKGROUND

## Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 21 REFERENCES

## Approximate distance oracles

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## All-pairs small-stretch paths

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Compact routing schemes

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Fast estimation of diameter and shortest paths (without matrix multiplication)

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Matrix Multiplication via Arithmetic Progressions

VIEW 2 EXCERPTS

HIGHLY INFLUENTIAL