The following pages link to (Q5743439):
Displaying 9 items.
- Matroid and knapsack center problems (Q300451) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- An improved approximation algorithm for knapsack median using sparsification (Q1751085) (← links)
- Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
- Constant approximation for fault-tolerant median problems via iterative rounding (Q2157915) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- On clustering with discounts (Q2671820) (← links)
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
- A Constant Factor Approximation Algorithm for Fault-Tolerant <i>k</i>-Median (Q5383960) (← links)
