The following pages link to (Q4449172):
Displaying 5 items.
- 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)
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality (Q3183477) (← links)
