B. Ju. Levit and B. N. Livshits. Neleneinye Setevye Transportnye Zadachi. Transport, Moscow, 1972. In Russian.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....cost arcs. Two lists connected in series Algorithms in this family try to anticipate, when compared to a plain FIFO policy, the updating of inexact labels of the nodes currently in Q before they are actually scanned. Lists with two insertion points have been proposed for this purpose in [22, 25, 26]. In these algorithms, Q can be viewed as two lists Q and Q where selection is made from the head of Q (from the head of Q whether Q = while insertion can be made either in Q or in Q . Since inexact labels may arise only once a node has been inserted into Q more than once, in algorithm ....

....is made from the head of Q (from the head of Q whether Q = while insertion can be made either in Q or in Q . Since inexact labels may arise only once a node has been inserted into Q more than once, in algorithm SPT L deque (proposed by Pape [26] and independently by Levit and Livshits [22]) candidate nodes are inserted the first time at the tail of Q , while later insertions take place at the head of Q . Therefore, in SPT L deque, Q is used as a stack while Q is used as a queue and contains each node at most once. The stack nature of Q is the cause of the exponential time ....

B. Ju. Levit and B. N. Livshits, Neleneinye setevye transportnye zadachi, Transport, Moscow (1972) in Russian.

.... Eva Tardos. 1 1. Introduction The shortest paths problem is one of the most fundamental network optimization problems. This problem comes up in practice and arises as a subproblem in many network optimization algorithms. Algorithms for this problem have been studied for a long time. See e.g. [2, 5, 6, 7, 18, 19, 21]. However, advances in the theory of shortest paths algorithms are still being made. See e.g. 1, 9, 13] A good description of the classical algorithms and their implementations appears in [10] On a network with negative length arcs, the best currently known time bound of O(nm) is achieved by ....

....investigation of available algorithms. In particular, a massive study of flow and matching algorithms was done for the First DIMACS Algorithm Implementation Challenge [15] In this paper we study practical performance of several shortest paths algorithms, including established methods [2, 6, 7, 11, 18, 19, 20, 21], recently proposed algorithms [1, 14] and new algorithms. The development of the new algorithms was based on the experimental feedback. We give theoretical explanation of the observed behavior of the algorithms and prove complexity bounds on the new algorithms. We also prove an interesting ....

[Article contains additional citation context not shown here]

B. Ju. Levit and B. N. Livshits. Neleneinye Setevye Transportnye Zadachi. Transport, Moscow, 1972. In Russian.

....was done while the author was at Computer Science Department, Stanford University, and supported in part by NSF Grant CCR 9307045. 1 Introduction The shortest paths problem is a fundamental network optimization problem. Algorithms for this problem have been studied for a long time. See e.g. [2, 7, 8, 10, 14, 15, 16]. An important special case of the problem occurs when no arc length is negative. In this case, implementations of Dijkstra s algorithm [8] achieve the best time bounds. An implementation of [11] runs in O(m n log n) time. Here n and m denote the number of nodes and arcs in the network, ....

B. Ju. Levit and B. N. Livshits. Neleneinye Setevye Transportnye Zadachi. Transport, Moscow, 1972. In Russian.

No context found.

B. Ju. Levit and B. N. Livshits. Neleneinye Setevye Transportnye Zadachi. Transport, Moscow, 1972. In Russian.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC