The Chinese deliveryman problem (Q2025136)
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 7347308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Chinese deliveryman problem |
scientific article; zbMATH DE number 7347308 |
Statements
The Chinese deliveryman problem (English)
0 references
11 May 2021
0 references
Chinese deliveryman problem
0 references
approximation algorithms
0 references
computational complexity
0 references
Chinese postman problem
0 references
graph search
0 references
0.8072797060012817
0 references
0.803773820400238
0 references
0.7830316424369812
0 references
0.7817815542221069
0 references
