Pages that link to "Item:Q3012910"
From MaRDI portal
The following pages link to A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (Q3012910):
Displaying 43 items.
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Clustering through continuous facility location problems (Q346248) (← links)
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
- Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
- LP-rounding algorithms for the fault-tolerant facility placement problem (Q491622) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs (Q644537) (← links)
- Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
- An approximation algorithm for the stochastic fault-tolerant facility location problem (Q743782) (← links)
- Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
- A cost-sharing method for the multi-level economic lot-sizing game (Q893607) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- Recovery guarantees for exemplar-based clustering (Q897656) (← links)
- Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
- An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities (Q1690580) (← links)
- An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- Facility location with red-blue demands (Q1785285) (← links)
- Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties (Q2015801) (← links)
- An improved per-scenario bound for the two-stage stochastic facility location problem (Q2018918) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← links)
- Concave connection cost facility location and the star inventory routing problem (Q2117697) (← links)
- Ordinal approximation for social choice, matching, and facility location problems given candidate positions (Q2190377) (← links)
- Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
- Erratum to: ``Internet shopping with price-sensitive discounts'' (Q2257102) (← links)
- Improved approximation algorithms for constrained fault-tolerant resource allocation (Q2348043) (← links)
- A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
- An approximation algorithm for the dynamic facility location problem with outliers (Q2421446) (← links)
- Approximating $k$-Median via Pseudo-Approximation (Q2805513) (← links)
- Approximation algorithms for the stochastic priority facility location problem (Q2868906) (← links)
- Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems (Q2971170) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties (Q3452561) (← links)
- Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
- (Q5091075) (← links)
- Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
- (Q5743432) (← links)
- (Q6065419) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)