Simple and fast reoptimizations for the steiner tree problem
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.
Keywords
reoptimizacija;Steinerjevo drevo;aproksimacijski algoritem;Steiner tree;approximation algorithms;reoptimization;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2009 |
| Typology: | 1.01 - Original Scientific Article |
| Organization: | UP - University of Primorska |
| UDC: | 519.85 |
| COBISS: |
1024188756
|
| ISSN: | Y507-0848 |
| Views: | 2833 |
| Downloads: | 26 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | Unknown |
|---|---|
| Secondary keywords: | Steiner tree;approximation algorithms;reoptimization; |
| Type (COBISS): | Not categorized |
| Pages: | str. 86-94 |
| Volume: | ǂVol. ǂ4 |
| Issue: | ǂno. ǂ2 |
| Chronology: | 2009 |
| ID: | 1477158 |
Recommended works:
Simple and fast reoptimizations for the steiner tree problem
2009,
no subtitle data available
Problem Steinerjevega drevesa
2017,
magistrsko delo
Vector connectivity in graphs
2014,
no subtitle data available
Problem Steinerjevih dreves
2020,
diplomsko delo
Steiner-Wienerjev indeks grafa
2017,
delo diplomskega seminarja