Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) |
scientific article; zbMATH DE number 2132678
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) |
scientific article; zbMATH DE number 2132678 |
Statements
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (English)
0 references
9 February 2005
0 references
Approximate algorithms
0 references
Differential ratio
0 references
Complexity theory
0 references
Combinatorial optimization
0 references
Performance ratio
0 references
Analysis of algorithms
0 references
Hamiltonian paths
0 references
0 references
0 references
0 references
0 references
0.8084545731544495
0 references
0.8059934973716736
0 references
0.8042295575141907
0 references
0.7833631634712219
0 references
0.7739204168319702
0 references
