Pages that link to "Item:Q300451"
From MaRDI portal
The following pages link to Matroid and knapsack center problems (Q300451):
Displaying 13 items.
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- A Lottery Model for Center-Type Problems with Outliers (Q5002613) (← links)
- (Q5002700) (← links)
- (Q5002778) (← links)
- (Q5075746) (← links)
- The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
- (Q5874506) (← links)
- (Q5874534) (← links)
- Small Space Stream Summary for Matroid Center (Q5875472) (← links)
- Approximation Algorithms for Matroid and Knapsack Means Problems (Q6053494) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
- New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
