Pages that link to "Item:Q5894066"

The following pages link to An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem (Q5894066):

Displaying 50 items.

• Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
• The online prize-collecting facility location problem (Q324761) (← links)
• An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
• An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
• Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
• Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
• A cost-sharing method for an uncapacitated facility location game with penalties (Q488891) (← 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 distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
• An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
• An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660) (← 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)
• A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
• An approximation algorithm for the stochastic fault-tolerant facility location problem (Q743782) (← links)
• Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
• A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
• A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
• Approximation algorithms for the robust facility leasing problem (Q1749787) (← links)
• Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
• Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
• Approximation algorithms for the fault-tolerant facility placement problem (Q1944947) (← links)
• An improved per-scenario bound for the two-stage stochastic facility location problem (Q2018918) (← links)
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
• An approximation algorithm for the \(k\)-level facility location problem with outliers (Q2047198) (← links)
• An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← links)
• Bounding quality of pure Nash equilibria in dual-role facility location games (Q2091109) (← links)
• Concave connection cost facility location and the star inventory routing problem (Q2117697) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• Facility location problems: a parameterized view (Q2275913) (← links)
• LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem (Q2295313) (← links)
• Improved approximation algorithms for constrained fault-tolerant resource allocation (Q2348043) (← links)
• An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
• A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
• Approximation algorithms for \(k\)-level stochastic facility location problems (Q2410048) (← links)
• Perturbation resilience for the facility location problem (Q2417105) (← links)
• Approximation algorithms for the fault-tolerant facility location problem with penalties (Q2422738) (← links)
• Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
• Approximation algorithms for median hub location problems (Q2424817) (← links)
• A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
• Approximating $k$-Median via Pseudo-Approximation (Q2805513) (← links)
• Approximation algorithms for the stochastic priority facility location problem (Q2868906) (← links)
• LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
• Improved Approximation Algorithm for Fault-Tolerant Facility Placement (Q3453283) (← links)
• The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)
• Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
• Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)