96 search results - page 5 / 20 » Fast Exact MultiConstraint Shortest Path Algorithms |
TMI
2010
13 years 5 months ago
2010
Abstract—Cardiac computed tomography (CT) has been improved over past years, but it still needs improvement for higher temporal resolution in the cases of high or irregular cardi...
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
SIAMCOMP
2010
13 years 1 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
SODA
2007
ACM
13 years 8 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...
CPAIOR
2011
Springer
12 years 10 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 ...