The following pages link to (Q4501548):
Displaying 23 items.
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- An explicit lower bound for TSP with distances one and two (Q1402211) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition (Q4522112) (← links)
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114) (← links)
- Improved Approximation Lower Bounds for TSP with Distances One and Two (Q4784456) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- A (slightly) improved approximation algorithm for metric TSP (Q6065169) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)
- A Modern View on Stability of Approximation (Q6163638) (← links)
