Pages that link to "Item:Q3434992"

The following pages link to Approximation Algorithms for Metric Facility Location Problems (Q3434992):

Displaying 50 items.

• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← 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)
• An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
• A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision (Q507628) (← links)
• A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
• Capacitated domination problem (Q534769) (← links)
• Deterministic sampling algorithms for network design (Q547282) (← 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)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
• LP-based approximation algorithms for capacitated facility location (Q662296) (← 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)
• Beyond Moulin mechanisms (Q834858) (← links)
• A cost-sharing method for the multi-level economic lot-sizing game (Q893607) (← links)
• Recovery guarantees for exemplar-based clustering (Q897656) (← links)
• Approximation algorithm for facility location with service installation costs (Q924885) (← links)
• A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
• A cost-sharing method for an economic lot-sizing game (Q1015308) (← links)
• Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
• A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
• An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
• Black-box reductions for cost-sharing mechanism design (Q1735730) (← 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)
• 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)
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
• Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
• Approximating soft-capacitated facility location problem with uncertainty (Q2251144) (← links)
• Soft-capacitated facility location game (Q2267278) (← 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)
• Approximation algorithm for uniform bounded facility location problem (Q2392747) (← links)
• An approximation algorithm for the dynamic facility location problem with outliers (Q2421446) (← links)
• Approximation algorithms for the fault-tolerant facility location problem with penalties (Q2422738) (← 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)