Approximation algorithms for some minimum postmen cover problems (Q5918771): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q114191469, #quickstatements; #temporary_batch_1707149277123 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114191469 / rank | |||
Normal rank | |||
Revision as of 20:08, 5 February 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
