New approximation algorithms for the minimum cycle cover problem (Q5896084)
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: New approximation algorithms for the minimum cycle cover problem |
scientific article; zbMATH DE number 7218090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New approximation algorithms for the minimum cycle cover problem |
scientific article; zbMATH DE number 7218090 |
Statements
New approximation algorithms for the minimum cycle cover problem (English)
0 references
7 July 2020
0 references
vehicle routing
0 references
cycle cover
0 references
traveling salesman problem
0 references
approximation algorithm
0 references
0.991532564163208
0 references
0.8744630813598633
0 references
0.8722284436225891
0 references
0.8681355714797974
0 references
