Zobrazeno 1 - 5
of 5
pro vyhledávání: '"STEINER SYSTEMS (COMBINATORICS)"'
Autor:
Barhum, Kfir
Publikováno v:
Technical report / Department of Computer Science, 792
In this work, we study the advice complexity of the online minimum Steiner tree problem (ST). Given a (known) graph G = (V,E) endowed with a weight function on the edges, a set of N terminals are revealed in a step-wise manner. The algorithm maintain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a77bcd52e079b54c1357c2f975ce5a77
Autor:
Juraj Hromkovic, Tobias Mömke, Björn Steffen, Andreas Sprock, Hans-Joachim Böckenhauer, Karin Freiermuth
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642130724
CIAC
Technical Report / ETH Zurich, Department of Computer Science, 658
CIAC
Technical Report / ETH Zurich, Department of Computer Science, 658
In this paper, we deal with several reoptimization variants of the Steiner tree problem in graphs obeying a sharpened β-triangle inequality. A reoptimization algorithm exploits the knowledge of an optimal solution to a problem instance for finding g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95a506e1b9ad5cc1b16fa95aefba7c1f