The following pages link to (Q4736842):
Displayed 5 items.
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← 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)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)