[PDF] Top 20 An auction algorithm for shortest paths
Has 10000 "An auction algorithm for shortest paths" found on our website. Below are the top 20 most common "An auction algorithm for shortest paths".
An auction algorithm for shortest paths
... In the single origin/single destination case, the algorithm maintains a single path starting at the origin, which is extended or contracted by a single node at each iter[r] ... Voir le document complet
33
Engineering a new algorithm for distributed shortest paths on dynamic networks
... literature for the dynamic distributed shortest paths problem are not able to concurrently update shortest paths as those in ...with an edge operation, the algorithm ... Voir le document complet
39
Efficient Multi-GPU Algorithm for All-Pairs Shortest Paths
... slower for sparse graph, a FLoyd-Warshall approach has the advantage of having regular data access patterns that are identical to those of a matrix ...required for a given graph, using a Floyd- Warshall ... Voir le document complet
10
An auction/sequential shortest path algorithm for the minimum cost network flow problem
... By the theory of the auction/shortest path algorithm, a shortest path in the reduced graph will be found in a finite number of iterations if there exists at lea[r] ... Voir le document complet
20
An auction algorithm for the max-flow problem
... The iteration tries to construct an augmenting path starting at nl by using the second path construction algorithm of the preceding section, applied to the reduced graph[r] ... Voir le document complet
33
A linear time algorithm for Shortest Cyclic Cover of Strings
... is an open access article under the CC BY license ( ...– for instance merging abcde with cdeba into abcdeba – allows to infer the sequence of a target molecule from the short reads produced by sequencing ... Voir le document complet
13
Enhancing the computation of distributed shortest paths on real dynamic networks
... the shortest path to each ...as for example the Open Shortest Path First (OSPF) protocol widely used in the Internet [?], require that a node knows the entire network topology, to compute its ... Voir le document complet
17
Point-to-point shortest paths on dynamic time-dependent road networks
... Recipe for Solving MINLPs In Section ...time-dependent shortest path prob- lem on possibly non FIFO networks with arbitrary arc cost functions, which turns out to be a ...(sBB) algorithm (3; 92; 131; ... Voir le document complet
190
Bounded-Curvature Shortest Paths through a Sequence of Points
... A shortest bounded-curvature path between two con gurations, without obstacles, is a concatenation of at most three arcs that are circular arcs of unit radius (C-segments) or line segments (S-segments) ...such ... Voir le document complet
54
A linear time algorithm for Shortest Cyclic Cover of Strings
... 3 for each following word until one reaches w 1 ...1 For instance in Figure 3, the Red-Blue circuit corresponding to the cyclic merge of the words ababb, abba , and then aab in this order, contains three ... Voir le document complet
16
Decomposing a Graph into Shortest Paths with Bounded Eccentricity
... to an already selected hub center, the NextHub procedure (see pseudo-code below) detects new hubs: it colors B(s, R) with a next color and runs a StopBFS procedure from its ...the algorithm encountered the ... Voir le document complet
29
Space and Time Trade-Off for the k Shortest Simple Paths Problem
... the shortest path from v 0 to t in T 0 ...a shortest extension of P 0 at e, but it is not necessarily simple (it is not simple if Pv 0 t(T 0 ) intersects {v 0 , · · · , v ...any shortest simple ... Voir le document complet
14
On the complexity of finding $k$ shortest dissimilar paths in a graph
... NP-complete for all Z ∈ {Jaccard, M in, M ax} Proof. For every Z ∈ {J accard, M in, M ax}, the problem is clearly in NP, so we only prove the NP-hardness by a reduction from the Long-Path ...exists ... Voir le document complet
10
A Decision-Theoretic Algorithm for Bundle Purchasing in Multiple Open Ascending-Price Auction
... the auction. With this as- sumption, only states that occur when an auction ends are considered in the ...the auction), or ...in an auction if the expected utility of doing so is ... Voir le document complet
7
An Auction-based Mechanism for Cooperative Sensing in Cognitive Networks
... framework for cognitive radio networks, which incentivizes selfish SUs to cooperate by introducing a virtual currency reward in an auction ...framework for the bid responses is also proposed ... Voir le document complet
14
Seeking for shortest paths between negative binomial distributions. Application to the statistical analysis of counts data.
... Processing these data, Manté and Kidé [15] found an overwhelming propor- tion of simple con gurations (more than 70%), while numerical cut points were quite rare. In the intricate cases, the rough solution was ... Voir le document complet
30
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
... Answering an open question of Golovach and Thilikos [ 17 ], Fluschnik et ...developed an algorithm running in n O(tw 2 ) time, that is, they showed that the problem lies in the ... Voir le document complet
17
Resource Sharing Strategies: Which Sharing to Better Protect Primary Shortest Paths?
... primary paths as the shortest ones in terms of a static metric ...costs). For instance, RIP mini- mizes the hop number (number of intermediate routers in a path) while OSPF applies the SPF ... Voir le document complet
19
Shortest Paths and Probabilities on Time-Dependent Graphs - Applications to Transport Networks
... IV. S INGLE S OURCE S HORTEST P ATH INCLUDING P ROBABILITIES In practice, we cannot guarantee an exact travelling time. We could give such a time but only with a certain probability. Some work has already been ... Voir le document complet
8
Finding the k Shortest Simple Paths: Time and Space trade-offs
... proposed an improvement of Yen’s algorithm called Node Classifi- cation (NC) ...precomputed shortest path tree of the digraph, NC 35 algorithm classifies the vertices of the digraph with ... Voir le document complet
27
Sujets connexes