2 search results - page 1 / 1 » All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylo... |
61
Voted
STACS
2005
Springer
15 years 3 months ago
2005
Springer
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...