๐Ÿ“–
Simple and fast reoptimizations for the Steiner tree problem
Bruno Escoffier, Martin Milanic, Vangelis Paschos

Simple and fast reoptimizations for the Steiner tree problem

Science & Mathematics Published 2007 Verification Pending

Overview & Synopsis

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.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Simple and fast reoptimizations for the Steiner tree problem
Author / Organization Bruno Escoffier, Martin Milanic, Vangelis Paschos
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2007
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-176848
Original Source Link Visit Source Page on hal.science »