Pages that link to "Item:Q2128771"

The following pages link to Approximation algorithms for the \(k\)-depots Hamiltonian path problem (Q2128771):

Displaying 8 items.

• An analysis of the extended Christofides heuristic for the \(k\)-depot TSP (Q635520) (← links)
• Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
• An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem (Q1752857) (← links)
• Approximating the multiple-depot multiple-terminal Hamiltonian path problem (Q2010925) (← links)
• \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
• An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem (Q6123387) (← links)
• A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints (Q6556160) (← links)