In this paper we study the problem of finding a minimum Steiner Tree given a minimum Steiner Tree for similar problem instance. We consider scenarios of altering an instance by locally changing the terminal set or the weight of an edge. For all modification scenarios we provide approximation algorithms that improve best currently known corresponding approximation ratios. © 2008 Springer-Verlag Berlin Heidelberg.
File in questo prodotto:
Non ci sono file associati a questo prodotto.