Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem

Theoretical Computer Science

Volumn 285, Issue 1, 2002, Pages 3-24

  Böckenhauer, Hans Joachim ^a   Hromkovič, Juraj ^a   Klasing, Ralf ^b   Seibert, Sebastian ^a   Unger, Walter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Stability of approximation; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

MULTIPLICATIVE CONSTANT FACTORS;

POLYNOMIAL APPROXIMATION;

EID: 0037125670     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00287-0     Document Type: Conference Paper

References (24)

1. Performance guarantees for approximation algorithms depending on parametrized triangle inequalities
2. Polynomial time approximation schemes for Euclidean TSP and other geometric problems
3. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
4. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
5. Performance guarantees for the TSP with a parameterized triangle inequality
6. Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
7. The complexity of theorem proving procedures
8. Stability of approximation algorithms and the knapsack problem
9. Fast approximation algorithms for the knapsack and sum of subsets problem
10. Approximation algorithms for combinatorial problems
11. On the ratio of the optimal integral and functional covers
12. The Euclidean traveling salesman problem is NP-complete