Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications
暂无分享,去创建一个
[1] Juraj Hromkovic,et al. Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem , 2002, Theor. Comput. Sci..
[2] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.
[3] Anna Zych,et al. Reoptimization of Weighted Graph and Covering Problems , 2008, WAOA.
[4] Juraj Hromkovic,et al. Reoptimization of Steiner Trees , 2008, SWAT.
[5] R. V. Stee,et al. Packing Rectangles into 2 OPT Bins Using Rotations , 2008 .
[6] Luca Bertazzi,et al. Reoptimizing the traveling salesman problem , 2003, Networks.
[7] Lars Arge,et al. Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings , 2006, SWAT.
[8] Michael A. Bender,et al. Performance guarantees for the TSP with a parameterized triangle inequality , 2000, Inf. Process. Lett..
[9] Guido Proietti,et al. On the Approximability of TSP on Local Modifications of Optimally Solved Instances , 2007, Algorithmic Oper. Res..
[10] Vangelis Th. Paschos,et al. Reoptimization of Minimum and Maximum Traveling Salesman's Tours , 2006, SWAT.
[11] Juraj Hromkovic,et al. Reoptimization of Steiner trees: Changing the terminal set , 2009, Theor. Comput. Sci..
[12] Dennis Komm,et al. Reoptimization of the metric deadline TSP , 2010, J. Discrete Algorithms.
[13] Juraj Hromkovic,et al. Approximation algorithms for the TSP with sharpened triangle inequality , 2000, Inf. Process. Lett..