Pages that link to "Item:Q300451"
From MaRDI portal
The following pages link to Matroid and knapsack center problems (Q300451):
Displayed 25 items.
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Constant approximation for fault-tolerant median problems via iterative rounding (Q2157915) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- The distance-constrained matroid median problem (Q2182102) (← links)
- On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
- On clustering with discounts (Q2671820) (← links)
- (Q4910809) (redirect page) (← links)
- A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
- Generalized Center Problems with Outliers (Q4972687) (← links)
- A Lottery Model for Center-Type Problems with Outliers (Q5002613) (← links)
- (Q5002700) (← links)
- (Q5002778) (← links)
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← 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)
- Approximation algorithms for diversity-bounded center problems (Q6111979) (← links)
- Fully dynamic clustering and diversity maximization in doubling metrics (Q6139043) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)