353 search results - page 22 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...