Pages that link to "Item:Q2848930"
From MaRDI portal
The following pages link to Improved Approximation Guarantees for Lower-Bounded Facility Location (Q2848930):
Displaying 11 items.
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
- Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
- Approximation algorithms for the lower bounded correlation clustering problem (Q2677653) (← links)
- Respecting lower bounds in uniform lower and upper bounded facility location problem (Q2695314) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- Improved bounds for metric capacitated covering problems (Q6107884) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
