137 search results - page 1 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
COLOGNETWENTE
2009
13 years 5 months ago
2009
TON
2002
13 years 7 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
AAAI
2004
13 years 8 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
COCOON
2001
Springer
13 years 11 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
ASIAMS
2007
IEEE
14 years 1 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...