Reoptimization of Steiner Trees

  • Davide Bilò
  • Hans-Joachim Böckenhauer
  • Juraj Hromkovič
  • Richard Královič
  • Tobias Mömke
  • Peter Widmayer
  • Anna Zych
Conference paper

DOI: 10.1007/978-3-540-69903-3_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5124)
Cite this paper as:
Bilò D. et al. (2008) Reoptimization of Steiner Trees. In: Gudmundsson J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Davide Bilò
    • 1
  • Hans-Joachim Böckenhauer
    • 1
  • Juraj Hromkovič
    • 1
  • Richard Královič
    • 1
  • Tobias Mömke
    • 1
  • Peter Widmayer
    • 1
  • Anna Zych
    • 1
  1. 1.Department of Computer ScienceETH ZurichSwitzerland

Personalised recommendations