Abstract
In this paper we improve the results in the literature concerning the problem of computing the minimum Steiner tree given the minimum Steiner tree for a similar problem instance. Using a σ-approximation algorithm computing the minimum Steiner tree from scratch, we provide a and a -approximation algorithm for altering the instance by removing a vertex from the terminal set and by increasing the cost of an edge, respectively. If we use the best up to date σ = ln 4 + ε, our ratios equal 1.218 and 1.279 respectively. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Bilò, D., & Zych, A. (2012). New advances in reoptimizing the minimum Steiner tree problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7464 LNCS, pp. 184–197). https://doi.org/10.1007/978-3-642-32589-2_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
