The following pages link to (Q3415353):
Displaying 8 items.
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011) (← links)
- On the Approximation Ratio of the Path Matching Christofides Algorithm (Q2891381) (← links)
- The Complexity of Restricted Variants of the Stable Paths Problem (Q3000275) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- (Q4607918) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)