353 search results - page 17 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
114
Voted
SOFSEM
2009
Springer
15 years 11 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
NETWORKS
2007
15 years 2 months ago
2007
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
106
Voted
AICCSA
2006
IEEE
15 years 8 months ago
2006
IEEE
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...
156
Voted
CPAIOR
2011
Springer
14 years 6 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
138
Voted
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...