Abstract: This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid regenerate the whole tree. Based on the concept of Local map, the algorithm tries to update as few nodes as possible to reduce cost. The experimenta

Key words: Moving target, Single-source shortest path tree, Approximate algorithms, Local map