Reoptimization of Steiner trees: changing the terminal set
type: Item
instance of: scholarly article
title: Reoptimization of Steiner trees: changing the terminal set
zbMATH Open document ID: 1192.68471
author: Hans-Joachim Böckenhauer
author: Richard Královič
author: Tobias Mömke
author: Peter Rossmanith
author: Juraj Hromkovič
published in: Theoretical Computer Science
publication date: 2009-08-21T00:00:00Z
full work available at URL: http://urn.kb.se/resolve
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5597938
zbMATH Keywords: approximation algorithms
zbMATH Keywords: reoptimization
zbMATH Keywords: Steiner tree
MaRDI profile type: Publication
OpenAlex ID: W1977823240
cites work: Reoptimizing the traveling salesman problem
cites work: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
cites work: The Steiner problem with edge lengths 1 and 2
cites work: Q3079180
cites work: Q4393480
cites work: The steiner problem in graphs
cites work: Simple and fast reoptimizations for the Steiner tree problem
cites work: Q4198056
cites work: Steiner tree problems
cites work: A Faster Algorithm for the Steiner Tree Problem
cites work: The asymptotic number of graphs not containing a fixed color-critical subgraph
cites work: Q4952699
DOI: 10.1016/J.TCS.2008.04.039
description: scientific article; zbMATH DE number 5597938