Pages that link to "Item:Q6039533"
From MaRDI portal
The following pages link to An approximation algorithm for the clustered path travelling salesman problem (Q6039533):
Displaying 6 items.
- An improved approximation algorithm for the clustered traveling salesman problem (Q456175) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139) (← links)
- Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
- Local search for <i>Hamiltonian Path</i> with applications to clustering visitation paths (Q4661201) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)