Pages that link to "Item:Q2010925"

The following pages link to Approximating the multiple-depot multiple-terminal Hamiltonian path problem (Q2010925):

Displaying 7 items.

• Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
• Approximation algorithms for the \(k\)-depots Hamiltonian path problem (Q2128771) (← links)
• \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
• A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots (Q2802244) (← links)
• A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem (Q3569885) (← 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)