\(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5682962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem |
scientific article; zbMATH DE number 5682962 |
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
0 references
0 references
0.9085432887077332
0 references
0.8706589937210083
0 references
0.8615209460258484
0 references
0.8604925870895386
0 references
0.8382933139801025
0 references
