On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097)
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 3959158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem |
scientific article; zbMATH DE number 3959158 |
Statements
On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (English)
0 references
1986
0 references
approximation algorithms
0 references
minimum and the maximum traveling salesman problem
0 references
heuristics
0 references
0 references
0 references
0.8280898928642273
0 references
0.8048432469367981
0 references
0.8028554320335388
0 references
