Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412)
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 6111686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for multiple terminal, Hamiltonian path problems |
scientific article; zbMATH DE number 6111686 |
Statements
Approximation algorithms for multiple terminal, Hamiltonian path problems (English)
0 references
30 November 2012
0 references
traveling salesman problem
0 references
Hamiltonian path problem
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0.9296419024467468
0 references
0.8892590999603271
0 references
0.8636702299118042
0 references
0.8615209460258484
0 references
0.8107593059539795
0 references
