Pages that link to "Item:Q1586139"
From MaRDI portal
The following pages link to Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139):
Displayed 8 items.
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- An improved approximation algorithm for the clustered traveling salesman problem (Q456175) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)