Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767)
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 6655869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for some min-max and minimum cycle cover problems |
scientific article; zbMATH DE number 6655869 |
Statements
Improved approximation algorithms for some min-max and minimum cycle cover problems (English)
0 references
24 November 2016
0 references
vehicle routing
0 references
cycle cover
0 references
traveling salesman problem
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.9614595174789428
0 references
0.8884360790252686
0 references
0.8744630813598633
0 references
