Approximation algorithms for some minimum postmen cover problems (Q5918771): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2022.01.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4226003954 / rank | |||
Normal rank | |||
Revision as of 18:39, 19 March 2024
scientific article; zbMATH DE number 7567766
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for some minimum postmen cover problems |
scientific article; zbMATH DE number 7567766 |
Statements
Approximation algorithms for some minimum postmen cover problems (English)
0 references
4 August 2022
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
