Approximation algorithms for some min-max postmen cover problems (Q2241210)
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: Approximation algorithms for some min-max postmen cover problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for some min-max postmen cover problems |
scientific article |
Statements
Approximation algorithms for some min-max postmen cover problems (English)
0 references
8 November 2021
0 references
approximation algorithm
0 references
traveling salesman problem
0 references
rural postman problem
0 references
Chinese postman problem
0 references
postmen cover
0 references
