390 search results - page 12 / 78 » Computing shortest paths for any number of hops |
ICCTA
2007
IEEE
15 years 6 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
113
click to vote
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
110
click to vote
TWC
2011
14 years 6 months ago
2011
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
107
click to vote
SODA
2007
ACM
15 years 1 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...