Zusammenfassung
Eines der bekanntesten kombinatorischen Optimierungsprobleme ist, einen kürzesten Weg zwischen zwei bestimmten Knoten eines Digraphen zu finden.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Allgemeine Literatur
Ahuja, R.K., Magnanti, T.L., und Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs 1993, Kapitel 4 und 5
Cormen, T.H., Leiserson, C.E., Rivest, R.L., und Stein, C.: Introduction to Algorithms. Second Edition. MIT Press, Cambridge 2001, Kapitel 24 und 25
Dreyfus, S.E.: An appraisal of some shortest path algorithms. Operations Research 17 (1969), 395–412
Gallo, G., und Pallottino, S.: Shortest paths algorithms. Annals of Operations Research 13 (1988), 3–79
Gondran, M., und Minoux, M.: Graphs and Algorithms. Wiley, Chichester 1984, Kapitel 2
Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York 1976, Kapitel 3
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Chapters 6–8
Tarjan, R.E.: Data Structures and Network Algorithms. SIAM, Philadelphia 1983, Kapitel 7
Zitierte Literatur
Ahuja, R.K., Mehlhorn, K., Orlin, J.B., und Tarjan, R.E.: Faster algorithms for the shortest path problem. Journal of the ACM 37 (1990), 213–223
Albrecht, C., Korte, B., Schietke, J., und Vygen, J.: Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discrete Applied Mathematics 123 (2002), 103–127
Bazaraa, M.S., und Langley, R.W.: A dual shortest path algorithm. SIAM Journal on Applied Mathematics 26 (1974), 496–501
Bellman, R.E.: On a routing problem. Quarterly of Applied Mathematics 16 (1958), 87–90
Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. Proceedings of the 39th Annual ACM Symposium on Theory of Computing (2007), 590–598
Cherkassky, B.V., und Goldberg, A.V.: Negative-cycle detection algorithms. Mathematical Programming A 85 (1999), 277–311
Dial, R.B.: Algorithm 360: shortest path forest with topological order. Communications of the ACM 12 (1969), 632–633
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959), 269–271
Edmonds, J., und Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19 (1972), 248–264
Fakcharoenphol, J., und Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. Journal of Computer and System Sciences 72 (2006), 868–889
Floyd, R.W.: Algorithm 97 – shortest path. Communications of the ACM 5 (1962), 345
Ford, L.R.: Network flow theory. Paper P-923, The Rand Corporation, Santa Monica 1956
Fredman, M.L., und Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization problems. Journal of the ACM 34 (1987), 596–615
Fredman, M.L., und Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48 (1994), 533–551
Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM Journal on Computing 24 (1995), 494–504
Henzinger, M.R., Klein, P., Rao, S., und Subramanian, S.: Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences 55 (1997), 3–23
Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 24 (1977), 1–13
Johnson, D.B.: A priority queue in which initialization and queue operations take O(log log D) time. Mathematical Systems Theory 15 (1982), 295–309
Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23 (1978), 309–311
Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4 (1979), 414–424
Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM 30 (1983), 852–865
Moore, E.F.: The shortest path through a maze. Proceedings of the International Symposium on the Theory of Switching, Part II, Harvard University Press, 1959, 285–292
Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Operations Research 41 (1993), 338–350
Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science 312 (2004), 47–74
Pettie, S., und Ramachandran, V.: Computing shortest paths with comparisons and additions. SIAM Journal on Computing 34 (2005), 1398–1431
Radzik, T.: Parametric flows, weighted means of cuts, and fractional combinatorial optimization. In: Complexity in Numerical Optimization (P.M. Pardalos, ed.), World Scientific, Singapore 1993
Raman, R.: Recent results on the single-source shortest paths problem. ACM SIGACT News 28 (1997), 81–87
Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM 46 (1999), 362–394
Thorup, M.: On RAM priority queues. SIAM Journal on Computing 30 (2000), 86–109
Thorup, M.: Integer priority queues with decrease key in constant time and the single source shortest paths problem. Journal of Computer and System Sciences 69 (2004), 330–353
Warshall, S.: A theorem on boolean matrices. Journal of the ACM 9 (1962), 11–12
Zwick, U.: All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM 49 (2002), 289–317
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Kürzeste Wege. In: Kombinatorische Optimierung. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76919-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-76919-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76918-7
Online ISBN: 978-3-540-76919-4
eBook Packages: Life Science and Basic Disciplines (German Language)