Skip to main content
SpringerLink
Log in

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study

  • Conference paper
  • First Online:
Algorithm Engineering (WAE 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1982))

Included in the following conference series:

Abstract

We present the first experimental study of the fully dynamic single-source shortest paths problem in digraphs with arbitrary (negative and non-negative) arc weights. We implemented and tested several variants of the theoretically fastest fully dynamic algorithms proposed in the literature, plus a new algorithm devised to be as simple as possible while matching the best worst-case bounds for the problem. According to experiments performed on randomly generated test sets, all the considered dynamic algorithms are faster by several orders of magnitude than recomputing from scratch with the best static algorithm. The experiments also reveal that, although the simple dynamic algorithm we suggest is usually the fastest in practice, other dynamic algorithms proposed in the literature yield better results for specific kinds of test sets.

Partially supported by the IST Programme of the EU under contract n. IST-1999- 14186 (ALCOM-FT).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.

    Google Scholar 

  2. D. Alberts, G. Cattaneo, and G. F. Italiano. An empirical study of dynamic graph algorithms. ACM Journal on Experimental Algorithmics, 2:Article 5, 1997.

    Google Scholar 

  3. G. Amato, G. Cattaneo, and G. F. Italiano. Experimental analysis of dynamic minimum spanning tree algorithms. In ACM-SIAM Symp. on Discrete Algorithms, pp. 1–10, 1997.

    Google Scholar 

  4. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. In European Symp. on Algorithms. Lect. Notes in Comp. Sc. 1136, pp. 349–363, 1996.

    Google Scholar 

  5. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming, 73:129–174, 1996.

    MathSciNet  MATH  Google Scholar 

  6. J. Edmonds, R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19:248–264, 1972.

    Article  Google Scholar 

  7. P. G. Franciosa, D. Frigioni, and R. Giaccio. Semi-dynamic shortest paths and breadth-first search on digraphs. In Symp. on Theoretical Aspects of Computer Science. Lect. Notes in Comp. Sc. 1200, pp. 33–46, 1997.

    Google Scholar 

  8. D. Frigioni, M. Ioffreda, U. Nanni, G. Pasqualone. Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem. ACM Journal on Experimental Algorithmics, 3:Article 5 (1998).

    Article  MathSciNet  Google Scholar 

  9. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms, 34(2):351–381, 2000.

    Article  MathSciNet  Google Scholar 

  10. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights. In European Symp. on Algorithms. Lect. Notes in Comp. Sc. 1461, pp. 320–331, 1998.

    Google Scholar 

  11. D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Shaefer, C. Zaroliagis. An experimental study of dynamic algorithms for directed graphs. In European Symp. on Algorithms. Lect. Notes in Comp. Sc. 1461, pp. 368–380, 1998.

    Google Scholar 

  12. A. V. Goldberg. Selecting problems for algorithm evaluation. In Workshop on Algorithm Engineering. Lect. Notes in Comp. Sc. 1668, pp. 1–11, 1999.

    Google Scholar 

  13. A. V. Goldberg, and T. Radzik. A heuristic improvement of the Bellman-Ford algorithm. Applied Math. Letters, 6:3–6, 1993.

    Article  MathSciNet  Google Scholar 

  14. K. Mehlhorn and S. Naher. LEDA, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96–102, 1995.

    Article  Google Scholar 

  15. G. Ramalingam. Bounded incremental computation. Lect. Notes in Comp. Sc. 1089, 1996.

    Google Scholar 

  16. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158:233–277, 1996.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, I-00198, Roma, Italy

    Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela & Umberto Nanni

Authors
  1. Camil Demetrescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniele Frigioni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alberto Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Umberto Nanni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Trier, Fachbereich IV — Informatik, 54286, Trier, Germany

    Stefan Näher

  2. Fakultät für Mathematik und Informatik, Universität Konstanz, 78457, Konstanz, Germany

    Dorothea Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demetrescu, C., Frigioni, D., Marchetti-Spaccamela, A., Nanni, U. (2001). Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. In: Näher, S., Wagner, D. (eds) Algorithm Engineering. WAE 2000. Lecture Notes in Computer Science, vol 1982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44691-5_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44691-5_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42512-0

  • Online ISBN: 978-3-540-44691-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation