Show document

A- | A+ | Print
Title:Simple and fast reoptimizations for the steiner tree problem
Authors:Escoffier, Bruno (Author)
Milanič, Martin (Author)
Paschos, Vangelis Th. (Author)
Work type:Not categorized
Tipology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
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
Year of publishing:2009
Number of pages:str. 86-94
Numbering:Vol. 4, no. 2
COBISS_ID:1024188756 Link is opened in a new window
Categories:Document is not linked to any category.
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
Share:Bookmark and Share

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Keywords:Steiner tree, approximation algorithms, reoptimization


Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
There are no comments!

Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica