Skip to Main Content (Press Enter)

Logo UNISS
  • ×
  • Home
  • Degrees
  • Courses
  • Jobs
  • People
  • Outputs
  • Organizations
  • Third Mission
  • Expertise & Skills

Logo UNISS

|

UNIFIND

uniss.it
  • ×
  • Home
  • Degrees
  • Courses
  • Jobs
  • People
  • Outputs
  • Organizations
  • Third Mission
  • Expertise & Skills
  1. Outputs

Reoptimization of Steiner Trees

Conference Paper
Publication Date:
2008
Short description:
Reoptimization of Steiner Trees / Bilò, Davide; BÖCKENHAUER HANS, Joachim; Hromkovic, Juraj; Královic, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna. - 5124:(2008), pp. 258-269. ( 11th Scandivian Workshop on Algorithm Theory (SWAT 2008) Gothenburg, Sweden July 2-4, 2008) [10.1007/978-3-540-69903-3_24].
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.
Iris type:
4.1 Contributo in Atti di convegno
List of contributors:
Bilò, Davide; BÖCKENHAUER HANS, Joachim; Hromkovic, Juraj; Královic, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna
Handle:
https://iris.uniss.it/handle/11388/73593
Book title:
Algorithm Theory - SWAT 2008
Published in:
LECTURE NOTES IN COMPUTER SCIENCE
Journal
LECTURE NOTES IN COMPUTER SCIENCE
Series
  • Overview

Overview

URL

http://link.springer.com/chapter/10.1007%2F978-3-540-69903-3_24
  • Use of cookies

Powered by VIVO | Designed by Cineca | 26.5.1.0