Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...