118 search results - page 1 / 24 » The Shortest Path Problem Under Partial Monitoring |
COLT
2006
Springer
13 years 6 months ago
2006
Springer
CORR
2007
Springer
13 years 4 months ago
2007
Springer
JCP
2007
13 years 4 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
ICCTA
2007
IEEE
13 years 11 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...
JDA
2006
13 years 4 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...