115 search results - page 6 / 23 » Approximation Algorithms for Shortest Descending Paths in Te... |
CAIP
2007
Springer
13 years 11 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
ESA
2005
Springer
14 years 26 days 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 ...
LCN
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
APPROX
2009
Springer
14 years 2 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...
ISAAC
2004
Springer
14 years 23 days ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...