Steinertrees.pptVIP

Steiner trees;Today;Steiner tree;Variants;Applications;Special cases;NP-completeness;Proof of reduction;Approximation algorithms;Shortest paths heuristic;Improving the shortest paths heuristic;Distance networks;Distance network heuristic;Distance network heuristic has ratio 2;Example where bound is met;Upgrading heuristic;On upgrading heuristic;Small number of terminals;Solving O(1) terminals;Simple preprocessing;Bottleneck Steiner distance;Reducing non-terminals;Use of lemma;Long edges;Paths with one terminal;PTm-test (paths with many terminals);Polynomial solvable cases