Approaches to the Steiner Problem in Networks

Abstract

The Steiner problem in networks is the problem of connecting a set of required vertices in a weighted graph at minimum cost. This is a classical \({\mathcal {NP}}\)-hard problem and a fundamental problem in network design with many practical applications.We approach this problem by various means: Relaxations, which relax the feasibility constraints, to get close to an optimal solution; heuristics to find good, but not necessarily optimal solutions; and reductions to simplify problem instances without abandoning the optimal solution. We have integrated these components into an exact algorithm that has achieved outstanding results in practice.In this article, we first provide a brief overview on the main algorithmic developments related to our work on this problem, citing our and others’ (already published) works. Then we focus on some central concepts, presenting detailed results on selected topics that offer special insight and potential for further improvement.KeywordsMinimum Span TreeSteiner TreeExact AlgorithmLinear RelaxationSteiner Tree ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.