Pages that link to "Item:Q294819"
From MaRDI portal
The following pages link to Approximation algorithms for the TSP with sharpened triangle inequality (Q294819):
Displaying 19 items.
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← 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)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Approximation algorithms for time-dependent orienteering. (Q1853044) (← 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)
- Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
- Deterministic Algorithms for Multi-criteria TSP (Q3010407) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)
- Approximating the Metric TSP in Linear Time (Q5302042) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs (Q6591461) (← links)
