Results 71 to 80 of about 1,116,280 (113)
DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS
, 2003 In this paper, we study dynamic shortest path problems that determine a shortest path from a specified source node to every other node in the network where arc travel times change dynamically. We consider two problems: the minimum time walk problem and
Pallottino, Stefano +7 more
core
True Costs of Cheap Labor Are Hard To Measure: Edge Deletion and VCG Payments in Graphs
, 2005 We address the problem of lowering the buyer's expected payments in shortest path auctions, where the buyer's goal is to purchase a path in a graph in which edges are owned by selfish agents.
Elkind, Edith
core
, 2019 In this paper A shortest path algorithm was stadied. Firstly, the basic defination of graph theory sach as graph, directed graph (or digraph) , weighted graph, path and shortest path will be introduced.
Aye Aye Myint +2 more
core
Shortest Path Geometric Rounding
, 1997 Exact implementations of algorithms of computational geometry are subject to exponential growth in running time and space. This exponential growth arises when the algorithms are cascaded: the output of one algorithm becomes the input to the next ...
Victor Milenkovic
core
Study on Single Source Shortest Path Algorithms
, 2017 Single Source Shortest Path Algorithm is one of the most used algorithm for routing and tracking path around the world for communication. Nowadays various famous apps are also using this algorithm to track the path and gaining information through the ...
Afser, Md. +3 more
core +1 more source
About some applications of the sufficient empirical method to statistical shortest path problems
Applications of the sufficient empirical method to statistical shortest path problems is ...
Andronov, Alexander, Kopytov, Evgeny
core
, 2006 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 ...
FESTA, PAOLA
core
, 2007 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 ...
FESTA, PAOLA
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The fuzzy shortest path length and the corresponding shortest path in a network
Computers and Operations Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tzung-Nan Chuang, Jung-Yuan Kung
exaly +4 more sources
Shortest paths on a polyhedron
Proceedings of the sixth annual symposium on Computational geometry - SCG '90, 1990We present an algorithm for determining the shortest path between a source point and any destination point along the surface of a polyhedron (need not be convex). Our algorithm uses a new approach which deviates from the conventional “continuous Dijkstra” technique.
Jindong Chen, Yijie Han
openaire +2 more sources