Pages that link to "Item:Q691412"
From MaRDI portal
The following pages link to Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412):
Displaying 12 items.
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Time-free solution to Hamilton path problems using P systems with \(d\)-division (Q1791419) (← links)
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem (Q2010925) (← 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)
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
- An approximation algorithm for finding long paths in Hamiltonian graphs (Q4820883) (← links)
- (Q4952685) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711527) (← 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)
