A note on Bertsekas' small-label-first strategy
نویسندگان
چکیده
An example is presented to show that the worst case complexity of Bertsekas small label rst strategy for the shortest path problem is exponential It becomes polynomial if when scanning a node i its successors j i are examined in the nondecreasing order of dij the distance between i and j
منابع مشابه
Implementation of Efficient Algorithms for Globally Optimal Trajectories ∗
We consider a continuous-space shortest path problem in a two-dimensional plane. This is the problem of finding a trajectory that starts at a given point, ends at the boundary of a compact set of <2, and minimizes a cost function of the form ∫ T 0 r(x(t))dt+ q(x(T )). For a discretized version of this problem, a Dijkstra-like method that requires one iteration per discretization point has been ...
متن کاملA simple and fast label correcting algorithm for shortest paths
We propose a new method for ordering the candidate nodes in label correcting methods for shortest path problems. The method is equally simple but much faster than the D’ Esopo-Pape algorithm. It is similar to the threshold algorithm in that it tries to scan nodes with small labels as early as possible, and performs comparably with that algorithm. Our algorithm can also be combined with the thre...
متن کاملA note on the Roman domatic number of a digraph
Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....
متن کاملCommunity Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملA Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem
Recently Bar-Gera (2002) proposed a quasi-Newton method for the origin-based formulation of the user equilibrium traffic assignment problem. This note shows that Bar-Gera’s algorithm may generate negative second-order derivative, leading to a “wrong search direction” which compromises the overall convergence performance. We prove that this shortcoming can be overcome by approximating the second...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 29 شماره
صفحات -
تاریخ انتشار 1997