Reoptimization of Steiner Trees
- Cite this paper as:
- Bilò D. et al. (2008) Reoptimization of Steiner Trees. In: Gudmundsson J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.