Simple and fast reoptimizations for the Steiner tree problem

Escoffier B, Milanič M, Paschos VT (2009)
Algorithmic Operations Research 4(2): 86-94.

Zeitschriftenaufsatz | Veröffentlicht| Englisch
 
Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Autor/in
Escoffier, Bruno; Milanič, Martin; Paschos, Vangelis Th.
Abstract / Bemerkung
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.
Erscheinungsjahr
2009
Zeitschriftentitel
Algorithmic Operations Research
Band
4
Ausgabe
2
Seite(n)
86-94
ISSN
1718-3235
Page URI
https://pub.uni-bielefeld.de/record/2427059

Zitieren

Escoffier B, Milanič M, Paschos VT. Simple and fast reoptimizations for the Steiner tree problem. Algorithmic Operations Research. 2009;4(2):86-94.
Escoffier, B., Milanič, M., & Paschos, V. T. (2009). Simple and fast reoptimizations for the Steiner tree problem. Algorithmic Operations Research, 4(2), 86-94.
Escoffier, B., Milanič, M., and Paschos, V. T. (2009). Simple and fast reoptimizations for the Steiner tree problem. Algorithmic Operations Research 4, 86-94.
Escoffier, B., Milanič, M., & Paschos, V.T., 2009. Simple and fast reoptimizations for the Steiner tree problem. Algorithmic Operations Research, 4(2), p 86-94.
B. Escoffier, M. Milanič, and V.T. Paschos, “Simple and fast reoptimizations for the Steiner tree problem”, Algorithmic Operations Research, vol. 4, 2009, pp. 86-94.
Escoffier, B., Milanič, M., Paschos, V.T.: Simple and fast reoptimizations for the Steiner tree problem. Algorithmic Operations Research. 4, 86-94 (2009).
Escoffier, Bruno, Milanič, Martin, and Paschos, Vangelis Th. “Simple and fast reoptimizations for the Steiner tree problem”. Algorithmic Operations Research 4.2 (2009): 86-94.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar