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 3 items.
- 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)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
