We consider the following (re)optimization problem: Given a minimum-cost Hamiltonian cycle of a complete non-negatively real weighted graph G = (V, E,c) obeying the strengthened triangle inequality (i.e., for some strength factor 1/2 ≤ β < 1, we have that ∀x,y,z 6 V, c(x,y) ≤ β(c(x,z) + c(y,z))), and given a set of k edge weight modifications producing a new weighted graph still obeying the strengthened triangle inequality, find a minimum-cost Hamiltonian cycle of the modified graph. This problem is known to be NP-hard already for a single edge weight modification. However, in this case, if both the input and the modified graph obey the strengthened triangle inequality and the respective strength factors are fixed (i.e., independent of ∣V∣), then it has been shown that the problem admits a PTAS (which just consists of either returning the old optimal cycle, or instead computing - for finitely many inputs - a new optimal solution from scratch, depending on the required accuracy in the approximation). In this paper we first extend the analysis of the PTAS to show its applicability for all k = O(1), and then we provide a large set of experiments showing that, in most practical circumstances, altering (uniformly at random) even several edge weights does not affect the goodness of the old optimal solution.
展开▼
