Implementation of Zelikovsky's 11/6-approximation algorithm for the minimum Steiner tree problem. More...
#include <ogdf/basic/ArrayBuffer.h>#include <ogdf/basic/Graph.h>#include <ogdf/basic/List.h>#include <ogdf/basic/basic.h>#include <ogdf/basic/comparer.h>#include <ogdf/basic/extended_graph_alg.h>#include <ogdf/graphalg/MinSteinerTreeModule.h>#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraphCopy.h>#include <ogdf/graphalg/steiner_tree/Full3ComponentGeneratorEnumeration.h>#include <ogdf/graphalg/steiner_tree/Full3ComponentGeneratorVoronoi.h>#include <ogdf/graphalg/steiner_tree/Save.h>#include <ogdf/graphalg/steiner_tree/SaveDynamic.h>#include <ogdf/graphalg/steiner_tree/SaveEnum.h>#include <ogdf/graphalg/steiner_tree/SaveStatic.h>#include <ogdf/graphalg/steiner_tree/Triple.h>#include <ogdf/graphalg/steiner_tree/common_algorithms.h>#include <limits>Go to the source code of this file.
Classes | |
| class | ogdf::MinSteinerTreeZelikovsky< T > |
| This class implements the 11/6-approximation algorithm by Zelikovsky for the minimum Steiner tree problem along with variants and practical improvements. More... | |
Namespaces | |
| namespace | ogdf |
| The namespace for all OGDF objects. | |
| namespace | ogdf::steiner_tree |
Implementation of Zelikovsky's 11/6-approximation algorithm for the minimum Steiner tree problem.
Definition in file MinSteinerTreeZelikovsky.h.