Stability and Robustness: Reliability in the World of Uncertainty

What to do nextThe Central TreeProblemHeuristics for theCTPFinal Remarks■ Find new mechanisms which can be incorporated into thegreedy strategy to make it deterministic and faster.■ Specify classes of graphs for which we can guarantee thequality of the solution found by the greedy constructionheuristic (e.g. being at most a factor of 1.5 from theoptimum). Here we measure in terms of the number ofconnected components in G − E T versus the number ofconnected components in G − E T ∗, where T ∗ is a centraltree■ Develop new approximation algorithms with guaranteedapproximation ratio better than 2 in terms of robust deviation.■ What is the worst case performance of the greedyconstruction heuristic in terms of the number of connectedcomponents in G − E T versus the number of connectedcomponents in G − E T ∗?Heuristics for the Central Tree Problem Yury Nikulin - p. 32/33