Pages that link to "Item:Q5901421"
From MaRDI portal
The following pages link to An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem (Q5901421):
Displayed 27 items.
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Incremental facility location problem and its competitive algorithms (Q604759) (← links)
- On min-max \(r\)-gatherings (Q627109) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- Recovery guarantees for exemplar-based clustering (Q897656) (← links)
- Approximation algorithm for facility location with service installation costs (Q924885) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
- Soft-capacitated facility location game (Q2267278) (← links)
- Approximation algorithm for uniform bounded facility location problem (Q2392747) (← links)
- Approximation Algorithm for the Uniform Bounded Facility Problem (Q3004651) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (Q3012910) (← links)
- Integrating facility location and production planning decisions (Q3057133) (← links)
- Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
- On Min-Max r-Gatherings (Q5443378) (← links)
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem (Q5505665) (← links)
- (Q6065419) (← links)
- Robust network function virtualization (Q6066069) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)