Searching for "An Approximation Algorithms for Steiner's Problem in Graphs." – sorted by Relevance.
-
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs
- A 1.598 Approximation Algorithm for the Steiner Problem in Graphs Stefan Hougardy Hans Jurgen
- Cited by 20 (1 self) – Add To MetaCart
-
Greedy Randomized Adaptive Search Procedures For The Steiner Problem In Graphs
- principles into an approximate algorithm for the Steiner problem in graphs is described in the following
- Cited by 84 (25 self) – Add To MetaCart
-
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
- of these generic steps into an approximate algorithm for the Steiner problem in graphs will be described
- Cited by 23 (11 self) – Add To MetaCart
-
A Hybrid Grasp With Perturbations And Adaptive Path-Relinking For The Steiner Problem In Graphs
- are available for the approximate solution of the Steiner problem in graphs, see e.g. Duin and Voss [11], Hwang
- Cited by 1 (0 self) – Add To MetaCart
-
A Parallel GRASP for the Steiner Problem in Graphs
- of these generic principles into an approximate algorithm for the Steiner problem in graphs is described
- Cited by 15 (8 self) – Add To MetaCart
-
On Reductions for the Steiner Problem in Graphs
- algorithm for solving the Steiner Problem in Graphs exists. An instance of the Steiner Problem in Graphs can
- Add To MetaCart
-
A Parallel GRASP For The Steiner Tree Problem In Graphs Using A Hybrid Local Search Strategy
- remarks are made in Section 6. 2. Sequential GRASP for the Steiner problem in graphs Approximate
- Cited by 15 (9 self) – Add To MetaCart

