Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

A primal-dual approximation algorithm for the Steiner forest problem

R. Ravi
Information Processing Letters 50 (4) 185 (1994)
DOI: 10.1016/0020-0190(94)00034-4
See this article

Worst-case performance of some heuristics for Steiner's problem in directed graphs

Stefan Voss
Information Processing Letters 48 (2) 99 (1993)
DOI: 10.1016/0020-0190(93)90185-C
See this article

An Effective Construction Algorithm for the Steiner Tree Problem Based on Edge Betweenness

Misa Fujita, Takayuki Kimura and Kenya Jin'no
Journal of Signal Processing 20 (4) 145 (2016)
DOI: 10.2299/jsp.20.145
See this article

The Steiner Tree Problem

Annals of Discrete Mathematics, The Steiner Tree Problem 53 151 (1992)
DOI: 10.1016/S0167-5060(08)70201-2
See this article

Steiner's problem in graphs: heuristic methods

Stefan Voß
Discrete Applied Mathematics 40 (1) 45 (1992)
DOI: 10.1016/0166-218X(92)90021-2
See this article

Steiner problem in Halin networks

Pawel Winter
Discrete Applied Mathematics 17 (3) 281 (1987)
DOI: 10.1016/0166-218X(87)90031-X
See this article

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

Hans Jürgen Prömel and Angelika Steger
Journal of Algorithms 36 (1) 89 (2000)
DOI: 10.1006/jagm.2000.1086
See this article

Heuristics for the Steiner problem in graphs

J. Plesník
Discrete Applied Mathematics 37-38 451 (1992)
DOI: 10.1016/0166-218X(92)90151-Y
See this article

Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity

A.Z. Zelikovsky
Annals of Discrete Mathematics, Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity 51 351 (1992)
DOI: 10.1016/S0167-5060(08)70655-1
See this article

On Optimal Solutions for the Optimal Communication Spanning Tree Problem

Franz Rothlauf
Operations Research 57 (2) 413 (2009)
DOI: 10.1287/opre.1080.0592
See this article

Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity

Ján Plesník
Annals of Discrete Mathematics, Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity 51 255 (1992)
DOI: 10.1016/S0167-5060(08)70639-3
See this article