Results 271 to 280 of about 524,063 (295)
Some of the next articles are maybe not open access.
Shortest paths with side sensors
2011 IEEE International Conference on Robotics and Automation, 2011We present a complete characterization of shortest paths to a goal position for a vehicle with unicycle kinematics and a limited range sensor, constantly keeping a given landmark in sight. Previous work on this subject studied the optimal paths in case of a frontal, symmetrically limited Field-Of-View (FOV). In this paper we provide a generalization to
SALARIS, PAOLO +2 more
openaire +1 more source
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 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
The weight of the shortest path tree
Random Structures & Algorithms, 2006AbstractThe 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 +2 more
openaire +3 more sources
Shortest Path Geometric Rounding
Algorithmica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Improved algorithms for the k simple shortest paths and the replacement paths problems
Information Processing Letters, 2009Moshe Lewenstein, Zvi Gotthilf
exaly
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM, 1999Mikkel Thorup
exaly
Finding Top-k Shortest Paths with Diversity
IEEE Transactions on Knowledge and Data Engineering, 2018Huiping Liu, Bin Yang, Bin Yang
exaly
A new approach to dynamic all pairs shortest paths
Journal of the ACM, 2004Camil Demetrescu +1 more
exaly
Finding the k reliable shortest paths under travel time uncertainty
Transportation Research Part B: Methodological, 2016Qingquan Li +2 more
exaly
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
SIAM Journal on Computing, 1993David R Karger
exaly

