Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Simple and fast reoptimizations for the steiner tree problem
Bruno Escoffier, Martin Milanič, Vangelis Th. Paschos, 2009, original scientific article

Abstract: 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.
Found in: osebi
Keywords: reoptimizacija, Steinerjevo drevo, aproksimacijski algoritem
Published: 15.10.2013; Views: 1397; Downloads: 10
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica