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 the normal view instead:
scientific article; zbMATH DE number 7678825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover |
scientific article; zbMATH DE number 7678825 |
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
0.9133089780807496
0 references
0.8795720338821411
0 references
0.8761579394340515
0 references
0.814041256904602
0 references
0.8086291551589966
0 references
