20.500.12556/RUP-943 Simple and fast reoptimizations for the steiner tree problem We address reoptimization issues for the Steiner tree problem. We assume that an optimal solution is given for some instance of the problem and the objective is to maintain a good solution when the instance is subject to minor modifications, the simplest such modifications being vertex insertions and deletions. We propose fast reoptimization strategies for the case of vertex insertions and we show that maintenance of a good solution for the 'shrunk' instance, without ex nihilo computation, is impossible when vertex deletions occur. We also provide lower bounds for the approximation ratios of the reoptimization strategies studied. reoptimizacija Steinerjevo drevo aproksimacijski algoritem Steiner tree approximation algorithms reoptimization true true false Angleški jezik Neznan jezik Delo ni kategorizirano 2013-10-15 12:05:24 2013-10-15 12:05:24 2024-03-01 11:59:24 0000-00-00 00:00:00 2009 0 0 str. 86-94 no. 2 Vol. 4 2009 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.85 1024188756 http://journals.hil.unb.ca/index.php/AOR/article/view/5653 1 https://repozitorij.upr.si/Dokument.php?lang=slv&id=943 Inštitut Andrej Marušič 0 0 0