46 search results - page 1 / 10 » Fully Dynamic Algorithms for Maintaining Shortest Paths Tree... |
JAL
2000
13 years 5 months ago
2000
ALGORITHMICA
1998
13 years 5 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
LCN
1999
IEEE
13 years 9 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...
FCT
1995
Springer
13 years 9 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
ESA
2005
Springer
13 years 10 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 ...