Baswana, Surender Algorithms and Complexity, MPI for Informatics, Max Planck Society;
MPI-I-2005-1-003.ps (beliebiger Volltext), 460KB
Baswana, S., & Telikepalli, K.(2005). Improved algorithms for all-pairs approximate shortest paths in weighted graphs (MPI-I-2005-1-003). Saarbrücken: Max-Planck-Institut für Informatik.