Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Improved algorithms for all-pairs approximate shortest paths in weighted graphs

Baswana, Surender and Telikepalli, Kavitha

MPI-I-2005-1-003. September 2005, 26 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
The all-pairs approximate shortest-paths problem is an interesting
variant of the classical all-pairs shortest-paths problem in graphs.
The problem aims at building a data-structure for a given graph
with the following two features. Firstly, for any two vertices,
it should report an {\emph{approximate}} shortest path between them,
that is, a path which is longer than the shortest path
by some {\emph{small}} factor. Secondly, the data-structure should require
less preprocessing time (strictly sub-cubic) and occupy optimal space
(sub-quadratic), at the cost of this approximation.

In this paper, we present algorithms for computing all-pairs approximate
shortest paths in a weighted undirected graph. These algorithms significantly
improve the existing results for this problem.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-2005-1-003.ps459 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Baswana, Surender and Telikepalli, Kavitha},
  TITLE = {Improved algorithms for all-pairs approximate shortest paths in weighted graphs},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-2005-1-003},
  MONTH = {September},
  YEAR = {2005},
  ISSN = {0946-011X},