Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1998: STACS 98 pp 14–24Cite as

Floats, integers, and single source shortest paths

  • Algorithm and Data Structures I
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

Most of this work was done while the author visited the Max-Planck-Institut für Informatik

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Albers and T. Hagerup, Improved parallel integer sorting without concurrent writing, Information and Control136 (1997) 25–51.

    MATH  MathSciNet  Google Scholar 

  2. 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. E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math.1 (1959), 269–271.

    Article  MATH  MathSciNet  Google Scholar 

  4. 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.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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.

    Article  MATH  MathSciNet  Google Scholar 

  6. 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. P. van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Syst. Th.10 (1977), 99–127.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Kbh.Ø, Denmark

    Mikkel Thorup

Authors
  1. Mikkel Thorup
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Thorup, M. (1998). Floats, integers, and single source shortest paths. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028545

Download citation

  • DOI: https://doi.org/10.1007/BFb0028545

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64230-5

  • Online ISBN: 978-3-540-69705-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation