STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximating average parameters of graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.00 |
We study the s-sources almost shortest paths (shortly, s-ASP) problem. Given an unweighted graph G = (V,E), and a subset S of s nodes, the goal is to compute almost shortest paths between all the pairs of nodes S ×V. The particular case when S = V is known as the all pairs almost shortest paths (shortly, APASP ) problem. We devise an algorithm with running time O(|E|nr + s ?n1 + z) for this problem that computes the paths Psub/subsub/subsub/subsub/subsub/subsub/sub