Implementation of an LP-based 1.39+epsilon Steiner tree approximation algorithm by Goemans et al. More...
#include <ogdf/basic/ArrayBuffer.h>#include <ogdf/basic/Graph.h>#include <ogdf/basic/GraphList.h>#include <ogdf/basic/List.h>#include <ogdf/basic/SubsetEnumerator.h>#include <ogdf/basic/basic.h>#include <ogdf/graphalg/MinSteinerTreeModule.h>#include <ogdf/graphalg/MinSteinerTreeTakahashi.h>#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraphCopy.h>#include <ogdf/graphalg/steiner_tree/Full2ComponentGenerator.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/LPRelaxationSER.h>#include <ogdf/graphalg/steiner_tree/common_algorithms.h>#include <ogdf/graphalg/steiner_tree/goemans/Approximation.h>#include <random>Go to the source code of this file.
Classes | |
| class | ogdf::MinSteinerTreeGoemans139< T > |
| This class implements the (1.39+epsilon)-approximation algorithm for the Steiner tree problem by Goemans et. More... | |
| class | ogdf::MinSteinerTreeGoemans139< T >::Main |
| Class managing LP-based approximation. More... | |
Namespaces | |
| namespace | ogdf |
| The namespace for all OGDF objects. | |
Enumerations | |
| enum class | Approx2State |
Implementation of an LP-based 1.39+epsilon Steiner tree approximation algorithm by Goemans et al.
Definition in file MinSteinerTreeGoemans139.h.
|
strongprivate |
Definition at line 167 of file MinSteinerTreeGoemans139.h.