The following pages link to (Q4782716):
Displaying 12 items.
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
- A note on the traveling salesman problem (Q1116903) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- On the approximation hardness of dense TSP and other path problems (Q1606928) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- Approximation algorithms for the traveling salesman problem (Q1812290) (← links)
- Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- \(z\)-approximations (Q2775899) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)