866 search results - page 32 / 174 » On Dynamic Shortest Paths Problems |
146
click to vote
TACAS
2007
Springer
16 years 10 hour ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
216
click to vote
WINE
2010
Springer
15 years 3 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
175
click to vote
HICSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Time-critical logistics (TCL) refer to time-sensitive procurement, processing and distribution activities. A confounding factor is the transportation networks that contain these l...
178
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
166
click to vote
APPROX
2009
Springer
16 years 15 days ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...