| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652644 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
Abstract
Given an instance of an optimization problem together with an optimal solution for it, a reoptimization problem asks for a solution for a locally modified input instance. In this paper we develop new reoptimization techniques and apply them to the Steiner Tree Problem. Our techniques significantly improve the previous results and apply to a variety of reoptimization problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
