Simple and Fast Reoptimizations for the Steiner Tree Problem

Authors

  • Bruno Escoffier Lamsade, Universite Paris Dauphine and CNRS
  • Martin Milanič University of Primorska
  • Vangelis Th. Paschos Université Paris-Dauphine

Keywords:

Steiner tree, approximation algorithms, reoptimization

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.

Downloads

Published

2009-09-16

How to Cite

Escoffier, B., Milanič, M., & Paschos, V. T. (2009). Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Operations Research, 4(2), Pages 86 - 94. Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/5653

Issue

Section

Articles