Pages that link to "Item:Q2241210"
From MaRDI portal
The following pages link to Approximation algorithms for some min-max postmen cover problems (Q2241210):
Displaying 8 items.
- Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- A 3/2-Approximation Algorithm for the Mixed Postman Problem (Q4699169) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)