Approximation algorithms for some min-max postmen cover problems (Q2241210): 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.1007/s10479-021-03933-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3135507527 / rank | |||
Normal rank | |||
Revision as of 01:49, 20 March 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
