Reoptimization of Steiner Trees

Authors:
Davide Bilò;Hans-Joachim Böckenhauer;Juraj Hromkovič;Richard Královič;Tobias Mömke;Peter Widmayer;Anna Zych
Affiliations:
Department of Computer Science, ETH Zurich, Switzerland;Department of Computer Science, ETH Zurich, Switzerland;Department of Computer Science, ETH Zurich, Switzerland;Department of Computer Science, ETH Zurich, Switzerland;Department of Computer Science, ETH Zurich, Switzerland;Department of Computer Science, ETH Zurich, Switzerland;Department of Computer Science, ETH Zurich, Switzerland
Venue:
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Year:
2008

Citing 4
Cited 14

The steiner problem with edge lengths 1 and 2,

Information Processing Letters
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Reoptimization of Steiner trees: Changing the terminal set

Theoretical Computer Science
On the hardness of reoptimization

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science

Reoptimization of the Metric Deadline TSP

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Reoptimization of Weighted Graph and Covering Problems

Approximation and Online Algorithms
Reoptimization of the Shortest Common Superstring Problem

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Reoptimization of minimum and maximum traveling salesman's tours

Journal of Discrete Algorithms
Fast approximation in subspaces by doubling metric decomposition

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Knowing all optimal solutions does not help for TSP reoptimization

Computation, cooperation, and life
Steiner tree reoptimization in graphs with sharpened triangle inequality

Journal of Discrete Algorithms
The steiner tree reoptimization problem with sharpened triangle inequality

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Reoptimization of the maximum weighted Pk-free subgraph problem under vertex insertion

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Reoptimization of some maximum weight induced hereditary subgraph problems

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On the Hardness of Reoptimization with Multiple Given Solutions

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Reoptimizing the strengthened metric TSP on multiple edge weight modifications

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
New advances in reoptimizing the minimum steiner tree problem

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Reoptimization of maximum weight induced hereditary subgraph problems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the problem of finding a minimum Steiner Tree given a minimum Steiner Tree for similar problem instance. We consider scenarios of altering an instance by locally changing the terminal set or the weight of an edge. For all modification scenarios we provide approximation algorithms that improve best currently known corresponding approximation ratios.