A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Stability of Approximation in Discrete Optimization
IFIP International Federation for Information Processing
One can try to parametrize the set of the instances of an optimization problem and look for in polynomial time achievable approximation ratio with respect to this parametrization. When the approximation ratio grows with the parameter, but is independent of the size of the instances, then we speak about stable approximation algorithms. An interesting point is that there exist stable approximation algorithms for problems like TSP that is not approximable within any polynomial approximation ratiodoi:10.1007/1-4020-8141-3_2 dblp:conf/ifipTCS/Hromkovic04 fatcat:ni5lfughxrczxgt6zrzrmdsx7u