422 search results - page 42 / 85 » Shortest paths between shortest paths and independent sets |
NETWORKS
2006
14 years 10 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...
SIROCCO
2010
14 years 11 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...
118
Voted
CORR
2012
Springer
13 years 5 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...
63
Voted
AAAI
2008
15 years 15 days 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 ...
JNW
2008
14 years 10 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 ...