New approximation algorithms for the minimum cycle cover problem (Q5919633)
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 7114328
| 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 7114328 |
Statements
New approximation algorithms for the minimum cycle cover problem (English)
0 references
7 October 2019
0 references
vehicle routing
0 references
cycle cover
0 references
traveling salesman problem
0 references
approximation algorithm
0 references
0 references
0 references
0.991532564163208
0 references
0.8884360790252686
0 references
0.887431263923645
0 references
0.8828175067901611
0 references
