Pages that link to "Item:Q4522114"
From MaRDI portal
The following pages link to Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114):
Displayed 12 items.
- New inapproximability bounds for TSP (Q494069) (← 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)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← 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)
- TSP with bounded metrics (Q2495398) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)
- A Modern View on Stability of Approximation (Q6163638) (← links)