Une heuristique pour le problème de l'arbre de Steiner
RAIRO-Oper. Res., 12 2 (1978) 207-212
Published online: 2017-02-06
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):
1 (2024)
https://doi.org/10.1007/978-3-030-54621-2_645-1
Combinatorial Optimization
Bernhard Korte and Jens VygenAlgorithms and Combinatorics, Combinatorial Optimization 21 543 (2018)
https://doi.org/10.1007/978-3-662-56039-6_20
Kombinatorische Optimierung
Bernhard Korte and Jens VygenKombinatorische Optimierung 573 (2018)
https://doi.org/10.1007/978-3-662-57691-5_20
An Effective Construction Algorithm for the Steiner Tree Problem Based on Edge Betweenness
Misa Fujita, Takayuki Kimura and Kenya Jin'noJournal of Signal Processing 20 (4) 145 (2016)
https://doi.org/10.2299/jsp.20.145
Ottimizzazione Combinatoria
Bernhard Korte and Jens VygenUNITEXT, Ottimizzazione Combinatoria 523 (2011)
https://doi.org/10.1007/978-88-470-1523-4_20
On Optimal Solutions for the Optimal Communication Spanning Tree Problem
Franz RothlaufOperations Research 57 (2) 413 (2009)
https://doi.org/10.1287/opre.1080.0592
3723 (2008)
https://doi.org/10.1007/978-0-387-74759-0_645
Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks
E. Althaus, G. Călinescu, I. I. Măndoiu, et al.Wireless Networks 12 (3) 287 (2006)
https://doi.org/10.1007/s11276-005-5275-x
The Push Tree problem
Frédéric Havet and Marc WenninkNetworks 44 (4) 281 (2004)
https://doi.org/10.1002/net.20038
Approximation Algorithms
Vijay V. VaziraniApproximation Algorithms 27 (2003)
https://doi.org/10.1007/978-3-662-04565-7_3
Foundations of Information Technology in the Era of Network and Mobile Computing
G. Călinescu, I. I. Măndoiu and A. ZelikovskyFoundations of Information Technology in the Era of Network and Mobile Computing 119 (2002)
https://doi.org/10.1007/978-0-387-35608-2_11
Encyclopedia of Optimization
Ding-Zhu Du, Bing Lu, Huang Ngo and Panos M. PardalosEncyclopedia of Optimization 2451 (2001)
https://doi.org/10.1007/0-306-48332-7_489
Steiner Trees in Industry
Clemens Gröpl, Stefan Hougardy, Till Nierhoff and Hans Jürgen PrömelCombinatorial Optimization, Steiner Trees in Industry 11 235 (2001)
https://doi.org/10.1007/978-1-4613-0255-1_7
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
Hans Jürgen Prömel and Angelika StegerJournal of Algorithms 36 (1) 89 (2000)
https://doi.org/10.1006/jagm.2000.1086
Tabu search for the Steiner problem in graphs
Celso C. Ribeiro and Maur�cio C. De SouzaNetworks 36 (2) 138 (2000)
https://doi.org/10.1002/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U
A primal-dual approximation algorithm for the Steiner forest problem
R. RaviInformation Processing Letters 50 (4) 185 (1994)
https://doi.org/10.1016/0020-0190(94)00034-4
Survivable networks, linear programming relaxations and the parsimonious property
Michel X. Goemans and Dimitris J. BertsimasMathematical Programming 60 (1-3) 145 (1993)
https://doi.org/10.1007/BF01580607
Worst-case performance of some heuristics for Steiner's problem in directed graphs
Stefan VossInformation Processing Letters 48 (2) 99 (1993)
https://doi.org/10.1016/0020-0190(93)90185-C
Heuristics for the Steiner problem in graphs
J. PlesníkDiscrete Applied Mathematics 37-38 451 (1992)
https://doi.org/10.1016/0166-218X(92)90151-Y
Steiner's problem in graphs: heuristic methods
Stefan VoßDiscrete Applied Mathematics 40 (1) 45 (1992)
https://doi.org/10.1016/0166-218X(92)90021-2
Steiner tree problems
F. K. Hwang and Dana S. RichardsNetworks 22 (1) 55 (1992)
https://doi.org/10.1002/net.3230220105
Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity
A.Z. ZelikovskyAnnals of Discrete Mathematics, Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity 51 351 (1992)
https://doi.org/10.1016/S0167-5060(08)70655-1
Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity
Ján PlesníkAnnals of Discrete Mathematics, Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity 51 255 (1992)
https://doi.org/10.1016/S0167-5060(08)70639-3
The Steiner Tree Problem
Annals of Discrete Mathematics, The Steiner Tree Problem 53 151 (1992)https://doi.org/10.1016/S0167-5060(08)70201-2
Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
Anjani JainNetworks 19 (7) 793 (1989)
https://doi.org/10.1002/net.3230190705
Steiner problem in networks: A survey
Pawel WinterNetworks 17 (2) 129 (1987)
https://doi.org/10.1002/net.3230170203
Steiner problem in Halin networks
Pawel WinterDiscrete Applied Mathematics 17 (3) 281 (1987)
https://doi.org/10.1016/0166-218X(87)90031-X