The following pages link to (Q4191856):
Displaying 8 items.
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Worst-case analysis of two travelling salesman heuristics (Q786657) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355) (← links)
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation (Q1823875) (← links)
- An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426) (← links)
- Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
- Truly tight bounds for TSP heuristics (Q6047697) (← links)