TRANSPORT YO‘LLARIDA MINIMAL MASOFALARNI HISOBLASHDA DEYKSTRI ALGORITIMINING AHAMIYATI
Article Sidebar
Main Article Content
Аннотация:
Ushbu maqolada Deykstra algoritmining eng qisqa yo‘lni topishdagi samaradorligi, amaliy qo‘llanilishi va cheklovlari tahlil qilinadi. Shuningdek, algoritmning A* kabi boshqa algoritmlar bilan solishtirilishi va samaradorlikni oshirish uchun takomillashtirish imkoniyatlari ko‘rib chiqiladi.
Article Details
Как цитировать:
Библиографические ссылки:
Dijkstra, E. W. (1959). "A Note on Two Problems in Connexion with Graphs". Numerische Mathematik, 1(1), 269-271.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.
Kleinberg, J., & Tardos, É. (2005). Algorithm Design. Pearson.
Sedgewick, R., & Wayne, K. (2011). Algorithms (4th ed.). Addison-Wesley.
Bellman, R. (1958). "On a Routing Problem". Quarterly of Applied Mathematics, 16(1), 87-90.
Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). "A Formal Basis for the Heuristic Determination of Minimum Cost Paths". IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107.
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall.
Moore, E. F. (1957). "The Shortest Path through a Maze". Proceedings of an International Symposium on the Theory of Switching, 285-292.
Tarjan, R. E. (1972). "Depth-First Search and Linear Graph Algorithms". SIAM Journal on Computing, 1(2), 146-160.
Johnson, D. B. (1977). "Efficient Algorithms for Shortest Paths in Sparse Networks". Journal of the ACM (JACM), 24(1), 1-13.
Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity. Dover Publications.
Goldberg, A. V., & Harrelson, C. (2005). "Computing the Shortest Path: A* Search Meets Graph Theory". Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 156-165.
Edsger, D. W. (1976). Selected Writings on Computing: A Personal Perspective. Springer.
Bertsekas, D. P. (1998). Network Optimization: Continuous and Discrete Models. Athena Scientific.
Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009). "Engineering Route Planning Algorithms". Algorithmics of Large and Complex Networks, 117-139.