Floats, integers, and single source shortest paths

  • Mikkel Thorup
Algorithm and Data Structures I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1373)

Abstract

Floats are ugly, but to everyone but theoretical computer scientists, they are the real thing. A linear time algorithm is presented for the undirected single source shortest paths problem with positive floating point weights.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AH97]
    S. Albers and T. Hagerup, Improved parallel integer sorting without concurrent writing, Information and Control136 (1997) 25–51.MATHMathSciNetGoogle Scholar
  2. [AM97]
    E. Althaus and K. Mehlhorn, Maximum Network Flow with Floating Point Arithmetic, Max-Plank-Institut für Informatik, Technical Report MPI-I-97-1-022, 1997.Google Scholar
  3. [Dij59]
    E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math.1 (1959), 269–271.MATHCrossRefMathSciNetGoogle Scholar
  4. [FW94]
    M.L. Fredman and D.E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comp. Syst. Sc.48 (1994) 533–551.MATHCrossRefMathSciNetGoogle Scholar
  5. [KKT95]
    D.R. Karger, P.N. Klein, and R.E. Tarjan, A Randomized LinearTime Algorithm to Find Minimum Spanning Trees J. ACM, 42:321–328, 1995.MATHCrossRefMathSciNetGoogle Scholar
  6. [Tho97]
    M. Thorup. Undirected Single Source Shortest Paths in Linear Time. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pages 12–21, 1997.Google Scholar
  7. [vBKZ77]
    P. van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Syst. Th.10 (1977), 99–127.MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Mikkel Thorup
    • 1
  1. 1.Department of Computer ScienceUniversity of CopenhagenKbh.Ø

Personalised recommendations