On the relationship between ATSP and the cycle cover problem (Q868952)
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: On the relationship between ATSP and the cycle cover problem |
scientific article; zbMATH DE number 5129792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the relationship between ATSP and the cycle cover problem |
scientific article; zbMATH DE number 5129792 |
Statements
On the relationship between ATSP and the cycle cover problem (English)
0 references
26 February 2007
0 references
assignment problem
0 references
cycle cover
0 references
traveling salesman problem
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8324031233787537
0 references
0.8286488056182861
0 references
