Results 241 to 250 of about 26,531 (262)

The weight of the shortest path tree

Random Structures & Algorithms, 2006
AbstractThe minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1. © 2006 Wiley Periodicals, Inc. Random Struct.
Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem   +2 more
openaire   +2 more sources

Shortest Path Algorithms

2008
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire   +2 more sources

Shortest Path Geometric Rounding

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Shortest Paths in Probabilistic Graphs

Operations Research, 1969
This paper considers the problem of finding shortest-path probability distributions in graphs whose branches are weighted with random lengths, examines the consequences of various assumptions concerning the nature of the available statistical information, and gives an exact method for computing the probability distribution, as well as methods based on
openaire   +2 more sources

Finding Top-k Shortest Paths with Diversity

IEEE Transactions on Knowledge and Data Engineering, 2018
Huiping Liu, Bin Yang, Bin Yang
exaly  

Improved algorithms for the k simple shortest paths and the replacement paths problems

Information Processing Letters, 2009
Moshe Lewenstein
exaly  

Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM, 1999
Mikkel Thorup
exaly  

Finding the k reliable shortest paths under travel time uncertainty

Transportation Research Part B: Methodological, 2016
Qingquan Li, William H K Lam, Bi Yu Chen   +2 more
exaly  

Finding the K shortest paths in a schedule-based transit network

Computers and Operations Research, 2012
Ato Xu, Sohail Chaudhry
exaly  

Computing almost shortest paths

ACM Transactions on Algorithms, 2005
Michael Elkin
exaly