This is Alexander Zelikovsky 11/6 approximation algorithm for steiner tree. More...
#include <zelikovsky_11_per_6.hpp>
Public Types | |
using | MT = data_structures::metric_traits< Metric > |
using | Dist = typename MT::DistanceType |
using | VertexType = typename MT::VertexType |
using | ThreeTuple = k_tuple_t< Idx, SUBSET_SIZE > |
using | Move = boost::tuple< ThreeTuple, Dist > |
using | ResultSteinerVertices = std::vector< VertexType > |
Public Member Functions | |
steiner_tree (const Metric &m, const Voronoi &vor) | |
template<typename OutputIterator > | |
void | get_result_steiner_vertices (OutputIterator out) |
Static Public Attributes | |
static const int | SUBSET_SIZE = 3 |
This is Alexander Zelikovsky 11/6 approximation algorithm for steiner tree.
class steiner_tree Example:
example file is steiner_tree_example.cpp
Metric | we only use this metric for distances (Steiner, Terminal) and (Terminal, Terminal) |
Voronoi | models WeakVoronoi (see Voronoi). This is a Voronoi division where generators are terminals of the steiner tree. |
Definition at line 66 of file zelikovsky_11_per_6.hpp.
|
inline |
m | |
vor |
Definition at line 85 of file zelikovsky_11_per_6.hpp.