410 search results - page 21 / 82 » Upgrading Shortest Paths in Networks |
121
click to vote
MFCS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
102
click to vote
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
154
Voted
WEA
2010
Springer
15 years 8 months ago
2010
Springer
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
120
click to vote
JCO
2006
15 years 1 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
IWQOS
2005
Springer
15 years 7 months ago
2005
Springer
— The traditional single (shortest) path routing paradigm leaves sessions vulnerable to a variety of security threats, especially eavesdropping. We propose to overcome this via d...