422 search results - page 42 / 85 » Shortest paths between shortest paths and independent sets |
130
click to vote
NETWORKS
2006
15 years 1 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
91
Voted
SIROCCO
2010
15 years 3 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
144
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
85
Voted
AAAI
2008
15 years 3 months ago
2008
An ant deposits pheromone along the path that it travels and is more likely to choose a path with a higher concentration of pheromone. The sensing and dropping of pheromone makes ...
116
click to vote
JNW
2008
15 years 1 months ago
2008
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...