Publisher
Springer International Publishing
Reference32 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and and hardness of approximation problems. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 14–23. IEEE Computer Society Press, Los Alamitos, CA (1992)
2. Ausiello, G., Bonifacci, V., Escoffier, B.: Complexity and approximation in reoptimization. In: Cooper, S.B., Sorbi, A. (eds.) Computability in Context: Computation and Logic in the Real World, pp. 101–130. Imperial College Press, London (2011)
3. Ausiello, G., Escoffier, B., Monnot, J., Paschos, V.T.: Reoptimization of minimum and maximum traveling salesman’s tours. J. Discrete Algorithms 7(4), 453–463 (2009)
4. Bockenhauer, H.J., Forlizzi, L., Hromkovic, J., Kneis, J., Kupke, J., Proietti, G., Widmayer, P.: On the approximability of tsp on local modifications of optimal solved instances. Algorithmic Oper. Res. 2(2), 83–93 (2007)
5. Bockenhauer, H.J., Hromkovic, J., Momke, T., Widmayer, P.: On the hardness of reoptimization. In: Geffert, V., et al. (eds.) SOFSEM, Lecture Notes in Computer Science, vol. 4910, pp. 50–65. Springer, Berlin (2008)