Pages that link to "Item:Q391983"
From MaRDI portal
The following pages link to Parameterized complexity of \(k\)-Chinese postman problem (Q391983):
Displaying 5 items.
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
