Pages that link to "Item:Q4180168"

The following pages link to Tight bounds for christofides' traveling salesman heuristic (Q4180168):

Displaying 21 items.

• Minimum-weight two-connected spanning networks (Q582215) (← links)
• Worst-case analysis of two travelling salesman heuristics (Q786657) (← links)
• Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns (Q1014953) (← links)
• Heuristics for unequal weight delivery problems with a fixed error guarantee (Q1095815) (← links)
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
• Discrete extremal problems (Q1152306) (← links)
• Analysis of Christofides' heuristic: some paths are more difficult than cycles (Q1180833) (← links)
• An approximation algorithm for the general routing problem (Q1197996) (← links)
• A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
• Topological design of ring networks (Q1318461) (← links)
• Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
• Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426) (← links)
• New primal and dual matching heuristics (Q1891231) (← links)
• Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio (Q2839206) (← links)
• SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
• Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
• On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965) (← links)
• A note on heuristics for the traveling salesman problem (Q3879044) (← links)
• Truly tight bounds for TSP heuristics (Q6047697) (← links)