Abstract.
The class Steiner minimal tree problem is an extension of the standard Steiner minimal tree problem in graphs, motivated by the problem of wire routing in the area of physical design of very large scale integration (VLSI). This problem is NP-hard, even if there are no Steiner nodes and the graph is a tree; moreover, there exists no polynomial time approximation algorithm with a constant bound on the relative error under the hypothesis that P \(\neq\) NP [16]. Hence, fast and good heuristic algorithms are needed in practice. In this paper, we present an integer programming formulation of the problem. Using Lagrangean relaxation and subgradient optimization, we derive a lower bound. In order to test the lower bound, we present a procedure for generating test problems for the class Steiner minimal tree problem that have known optimal solutions. The computational experiments for the test problems demonstrate that the lower bound is very tight and differs from the optimal solutions by only a few percent on average for sparse graphs.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 5 July 1999 / Revised version: 14 July 2000
Rights and permissions
About this article
Cite this article
Yang, B., Gillard, P. The class Steiner minimal tree problem: a lower bound and test problem generation. Acta Informatica 37, 193–211 (2000). https://doi.org/10.1007/s002360000042
Issue Date:
DOI: https://doi.org/10.1007/s002360000042