DIMACS TR: 2007-01
Simple and fast reoptimizations for the Steiner tree problem
Authors: Bruno Escoffier, Martin Milanic and Vangelis Th. Paschos
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.
Paper Available at:
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2007/2007-01.ps.gz
DIMACS Home Page