Pages that link to "Item:Q2448182"
From MaRDI portal
The following pages link to Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint (Q2448182):
Displaying 9 items.
- A 3/2-approximation algorithm for \(k_i\)-partitioning (Q408403) (← links)
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint (Q933069) (← links)
- \(k\)-partitioning problems with partition matroid constraint (Q1022585) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- Optimal matroid partitioning problems (Q2032344) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- Min-Max partitioning problem with matroid constraint (Q2519447) (← links)
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (Q5096911) (← links)
- Optimal matroid partitioning problems (Q5136271) (← links)