Pages that link to "Item:Q2912835"
From MaRDI portal
The following pages link to A 5-Approximation for Capacitated Facility Location (Q2912835):
Displaying 25 items.
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
- Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- A note on LP-based approximation algorithms for capacitated facility location problem (Q2172603) (← links)
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space (Q2197535) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Improved local search for universal facility location (Q2354309) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- Respecting lower bounds in uniform lower and upper bounded facility location problem (Q2695314) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
- (Q5002778) (← links)
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
- (Q5090960) (← links)
- (Q5874473) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem (Q6053495) (← links)
- (Q6065419) (← links)
- Improved bounds for metric capacitated covering problems (Q6107884) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
- FPT approximation for capacitated clustering with outliers (Q6658317) (← links)