Stability and Robustness: Reliability in the World of Uncertainty

One more evidence of NP-hardnessThe Central TreeProblemHeuristics for theCTPFinal RemarksAverbakh and Lebedev proved in 2004 that the RSTP isNP-Hard even if the intervals of uncertainty are all equal to[0, 1]. They also proved that the RSTP is polynomially solvableif the number of edges with uncertain lengths is fixed orbounded by the logarithm of a polynomial function of the totalnumber of edges.Heuristics for the Central Tree Problem Yury Nikulin - p. 10/33