Sciweavers

364 search results - page 8 / 73
» Shortest-path network interdiction
Sort
View
TRANSCI
1998
40views more  TRANSCI 1998»
13 years 7 months ago
Shortest Path Algorithms: An Evaluation Using Real Road Networks
F. Benjamin Zhan, Charles E. Noon
NETCOOP
2007
Springer
14 years 1 months ago
A New Necessary Condition for Shortest Path Routing
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
Mats Petter Pettersson, Krzysztof Kuchcinski
NETWORKS
2010
13 years 5 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 2 months ago
Random road networks: the quadtree model
What does a typical road network look like? Existing generative models tend to focus on one aspect to the exclusion of others. We introduce the general-purpose quadtree model and ...
David Eisenstat
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
14 years 1 months ago
Highway Hierarchies Hasten Exact Shortest Path Queries
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...
Peter Sanders, Dominik Schultes