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 12 items.
- An approximation algorithm for the minimum co-path set problem (Q547306) (← links)
- 3-partitioning problems for maximizing the minimum load (Q702354) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- Path cover problems with length cost (Q6069927) (← links)
- A local search algorithm for the \(k\)-path partition problem (Q6181375) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
- Approximation algorithms for covering vertices by long paths (Q6586665) (← links)
- Improved approximation algorithms for the \(k\)-path partition problem (Q6635814) (← links)