Pages that link to "Item:Q1951570"

The following pages link to A 1.488 approximation algorithm for the uncapacitated facility location problem (Q1951570):

Displaying 50 items.

• Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
• The online prize-collecting facility location problem (Q324761) (← links)
• A lower bound for metric 1-median selection (Q340556) (← links)
• An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
• Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
• An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
• A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← 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)
• Efficient sensor network management for asset localization (Q1654358) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
• Approximation algorithms for the robust facility leasing problem (Q1749787) (← links)
• Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
• Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties (Q1983746) (← links)
• Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
• 2-level station location for bike sharing (Q2039650) (← links)
• Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
• An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
• An approximation algorithm for the \(k\)-level facility location problem with outliers (Q2047198) (← links)
• Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
• On stochastic \(k\)-facility location (Q2151361) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space (Q2197535) (← links)
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
• Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
• Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
• Local search approximation algorithms for the sum of squares facility location problems (Q2274862) (← links)
• LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem (Q2295313) (← links)
• An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
• Perturbation resilience for the facility location problem (Q2417105) (← links)
• Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce (Q2419538) (← 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)
• Approximation algorithm for squared metric two-stage stochastic facility location problem (Q2424830) (← links)
• An approximation algorithm for the \(k\)-median warehouse-retailer network design problem (Q2441152) (← links)
• Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
• An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem (Q2942463) (← links)
• LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
• Dynamic Sum-Radii Clustering (Q2980896) (← links)
• Analysis of a local search algorithm for the k-facility location problem (Q3186668) (← links)
• Approximating Airports and Railways (Q3304099) (← links)
• From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
• Improved Approximation Algorithm for Fault-Tolerant Facility Placement (Q3453283) (← links)
• The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)