Approximation algorithms for some min-max postmen cover problems (Q2241210): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:56, 2 February 2024
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
