193 search results - page 16 / 39 » A Lower Bound for the Shortest Path Problem |
105
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
162
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
111
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
109
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
127
click to vote
JPDC
2006
14 years 11 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...