\(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem |
scientific article |
Statements
\(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (English)
0 references
18 March 2010
0 references
approximation algorithms
0 references
Hamiltonian path problem
0 references
traveling salesman problem
0 references
