Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031)
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: Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover |
scientific article |
Statements
Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (English)
0 references
26 April 2023
0 references
approximation algorithm
0 references
rural postman problem
0 references
Chinese postman problem
0 references
rural postmen cover
0 references
min-max objective
0 references
0 references
0 references
0 references
0 references
