Pages that link to "Item:Q2424798"
From MaRDI portal
The following pages link to An improved approximation algorithm for the minimum 3-path partition problem (Q2424798):
Displaying 6 items.
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- Path cover problems with length cost (Q6069927) (← links)
- Approximation algorithms for the directed path partition problems (Q6113908) (← links)
- A local search algorithm for the \(k\)-path partition problem (Q6181375) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
