Reusing optimal TSP solutions for locally modified input instances: Extended abstract

IFIP International Federation for Information Processing

Volumn 209, Issue , 2006, Pages 251-270

  Böckenhauer, Hans Joachim ^a   Forlizzi, Luca ^b   Hromkoviǎ, Juraj ^a   Kneis, Joachim ^c   Kupke, Joachim ^a   Proietti, Guido ^b,d   Widmayer, Peter ^a  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c RWTH AACHEN UNIVERSITY   (Germany)

^d CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; OPTIMAL SYSTEMS; POLYNOMIAL APPROXIMATION;

ADDITIONAL KNOWLEDGE; APPROXIMABILITY; APPROXIMATION RATIOS; GRAPH PROBLEMS; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; TRAVELING SALESPERSON PROBLEM;

OPTIMIZATION;

EID: 33845646390     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-34735-6_21     Document Type: Article

References (21)

1. T. Andreae: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks 38, 2001, pp. 59-67.
2. T. Andreae, H.-J. Bandelt: Performance guarantees for approximation algorithms depending on parameterized triangle inequalities. SIAM Journal on Discrete Mathematics 8, 1995, pp. 1-16.
3. M. Bender, C. Chekuri: Performance guarantees for TSP with a parameterized triangle inequality. Information Processing Letters 73, 2000, pp. 17-21.
4. H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger: Approximation algorithms for TSP with sharpened triangle inequality. Information Processing Letters 75, 2000, pp. 133-138.
5. H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theoretical Computer Science 285, 2002, pp. 3-24.
6. H.-J. Böckenhauer, J. Hromkovič, J. Kneis, J. Kupke: On the parameterized approximability of TSP with deadlines. Theory of Computing Systems, to appear.
7. H.-J. Böckenhauer, J. Hromkovič, J. Kneis, J. Kupke: On the approximation hardness of some generalizations of TSP. Proc. SWAT 2006, to appear.
8. H.-J. Böckenhauer, S. Seibert: Improved lower bounds on the approximability of the traveling salesman problem. RAIRO Theoretical Informatics and Applications 34, 2000, pp. 213-255.
9. N. Christofides: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, 1976.
10. J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M. M. Solomon, F. Soumis: VRP with time windows. In: P. Toth, D. Vigo (eds.): The Vehicle Routing Problem, SIAM 2001, pp. 157-193.
11. L. Forlizzi, J. Hromkovič, G. Proietti, S. Seibert: On the stability of approximation for Hamiltonian path problems. Algorithmic Operations Research 1(1), 2006, pp. 31-45.
12. H. Greenberg: An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: D. L. Woodruff (ed.): Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, Kluwer Academic Publishers, 1998, pp. 97-148.
13. N. Guttmann-Beck, R. Hassin, S. Khuller, B. Raghavachari: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica 28, 2000, pp. 422-437.
14. J. A. Hoogeveen: Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Operations Research Letters 10, 1978, pp. 178-193.
15. J. Hromkovič: Stability of approximation algorithms for hard optimization problems. Proc. SOFSEM'99, Springer LNCS 1725, 1999, pp. 29-47.
16. J. Hromkovič: Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Springer 2003.
17. M. Libura: Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. Discrete Applied Mathematics 30, 1991, pp. 197-211.
18. M. Libura, E. S. van der Poort, G. Sierksma, J. A. A. van der Veen: Stability aspects of the traveling salesman problem based on κ-best solutions. Discrete Applied Mathematics 87, 1998, pp. 159-185.
19. Ch. Papadimitriou, K. Steiglitz: Some examples of difficult traveling salesman problems. Operations Research 26, 1978, pp. 434-443.
20. Y. N. Sotskov, V. K. Leontev, E. N. Gordeev: Some concepts of stability analysis in combinatorial optimization. Discrete Appl. Math. 58, 1995, pp. 169-190.
21. S. Van Hoesel, A. Wagelmans: On the complexity of postoptimality analysis of 0/1 programs. Discrete Applied Mathematics 91, 1999, pp. 251-263.