10901 search results - page 106 / 2181 » Approximations in Distributed Optimization |
AMC
2007
15 years 6 months ago
2007
149
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
113
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer