Pages that link to "Item:Q3467839"
From MaRDI portal
The following pages link to Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839):
Displaying 7 items.
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- Network optimization on partitioned pairs of points (Q5136221) (← links)
- Approximating TSP Solution by MST Based Graph Pyramid (Q5325746) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)