Pages that link to "Item:Q1608333"
From MaRDI portal
The following pages link to Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333):
Displaying 16 items.
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (Q866548) (← links)
- On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions (Q1933544) (← links)
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
- On the Approximation Ratio of the Path Matching Christofides Algorithm (Q2891381) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Improved approximations for ordered TSP on near-metric graphs (Q5248874) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
