b'@techreport{,'b'\nTITLE = {Improved algorithms for all-pairs approximate shortest paths in weighted graphs},\nAUTHOR = {Baswana, Surender and Telikepalli, Kavitha},\nLANGUAGE = {eng},\nURL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2005-1-003},\nNUMBER = {MPI-I-2005-1-003},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {2005},\nDATE = {2005},\nABSTRACT = {The all-pairs approximate shortest-paths problem is an interesting<br>variant of the classical all-pairs shortest-paths problem in graphs.<br>The problem aims at building a data-structure for a given graph<br>with the following two features. Firstly, for any two vertices,<br>it should report an {\\emph{approximate}} shortest path between them,<br>that is, a path which is longer than the shortest path<br>by some {\\emph{small}} factor. Secondly, the data-structure should require<br>less preprocessing time (strictly sub-cubic) and occupy optimal space<br>(sub-quadratic), at the cost of this approximation.<br><br>In this paper, we present algorithms for computing all-pairs approximate<br>shortest paths in a weighted undirected graph. These algorithms significantly<br>improve the existing results for this problem.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'