Implementation of the 1.55-approximation algorithm for the Minimum Steiner Tree problem by Robins and Zelikovsky. More...
#include <ogdf/basic/Graph.h>#include <ogdf/basic/List.h>#include <ogdf/basic/SubsetEnumerator.h>#include <ogdf/basic/basic.h>#include <ogdf/basic/extended_graph_alg.h>#include <ogdf/basic/simple_graph_alg.h>#include <ogdf/graphalg/MinSteinerTreeMehlhorn.h>#include <ogdf/graphalg/MinSteinerTreeModule.h>#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraphCopy.h>#include <ogdf/graphalg/steiner_tree/Full3ComponentGeneratorVoronoi.h>#include <ogdf/graphalg/steiner_tree/FullComponentDecisions.h>#include <ogdf/graphalg/steiner_tree/FullComponentGeneratorCaller.h>#include <ogdf/graphalg/steiner_tree/FullComponentGeneratorDreyfusWagner.h>#include <ogdf/graphalg/steiner_tree/FullComponentGeneratorDreyfusWagnerWithoutMatrix.h>#include <ogdf/graphalg/steiner_tree/FullComponentStore.h>#include <ogdf/graphalg/steiner_tree/SaveStatic.h>#include <ogdf/graphalg/steiner_tree/common_algorithms.h>#include <algorithm>#include <memory>#include <set>#include <vector>Go to the source code of this file.
Classes | |
| class | ogdf::MinSteinerTreeRZLoss< T > |
| This class implements the loss-contracting (1.55+epsilon)-approximation algorithm for the Steiner tree problem by Robins and Zelikovsky. More... | |
| class | ogdf::MinSteinerTreeRZLoss< T >::Main |
Namespaces | |
| namespace | ogdf |
| The namespace for all OGDF objects. | |
Macros | |
| #define | OGDF_STEINERTREE_RZLOSS_REDUCE_ON |
Implementation of the 1.55-approximation algorithm for the Minimum Steiner Tree problem by Robins and Zelikovsky.
Definition in file MinSteinerTreeRZLoss.h.
| #define OGDF_STEINERTREE_RZLOSS_REDUCE_ON |
Definition at line 63 of file MinSteinerTreeRZLoss.h.