Approximation algorithm for min-max cycle cover problem on a mixed graph (Q5153435)
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 7404494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for min-max cycle cover problem on a mixed graph |
scientific article; zbMATH DE number 7404494 |
Statements
29 September 2021
0 references
approximation algorithm
0 references
mixed graph
0 references
min-max cycle cover
0 references
rural postman problem
0 references
Chinese postman problem
0 references
traveling salesman problem
0 references
0.8227377533912659
0 references
0.8139522671699524
0 references
0.799676775932312
0 references
0.7980153560638428
0 references
