60 search results - page 7 / 12 » Construction of Minimum-Weight Spanners |
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
ISAAC
1993
Springer
13 years 11 months ago
1993
Springer
DIALM
2007
ACM
13 years 11 months ago
2007
ACM
ALGORITHMICA
2007
13 years 7 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
SIROCCO
2001
13 years 8 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...