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.
Reoptimization of Steiner Trees / Bilò, Davide; BÖCKENHAUER HANS, Joachim; Hromkovic, Juraj; Královic, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna. - 5124:(2008), pp. 258-269. (Intervento presentato al convegno 11th Scandivian Workshop on Algorithm Theory (SWAT 2008) tenutosi a Gothenburg, Sweden nel July 2-4, 2008) [10.1007/978-3-540-69903-3_24].
Reoptimization of Steiner Trees
BILÒ, Davide;
2008-01-01
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
