Pages that link to "Item:Q4240134"

The following pages link to Greedy Strikes Back: Improved Facility Location Algorithms (Q4240134):

Displaying 50 items.

• 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)
• On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
• The traveling \(k\)-median problem: approximating optimal network coverage (Q2085738) (← links)
• Bounding quality of pure Nash equilibria in dual-role facility location games (Q2091109) (← links)
• Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
• On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
• To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
• Concave connection cost facility location and the star inventory routing problem (Q2117697) (← links)
• An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
• Improved parameterized approximation for balanced \(k\)-median (Q2150584) (← links)
• On stochastic \(k\)-facility location (Q2151361) (← 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)
• Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← 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)
• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
• Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
• Soft-capacitated facility location game (Q2267278) (← 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)
• Improved approximation algorithms for constrained fault-tolerant resource allocation (Q2348043) (← links)
• The minimum \(k\)-storage problem on directed graphs (Q2355709) (← links)
• An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
• A new approximation algorithm for the \(k\)-facility location problem (Q2382290) (← links)
• On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
• Approximation algorithms for \(k\)-level stochastic facility location problems (Q2410048) (← links)
• Perturbation resilience for the facility location problem (Q2417105) (← 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)
• Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
• Approximation algorithm for squared metric two-stage stochastic facility location problem (Q2424830) (← links)
• A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
• A \(k\)-product uncapacitated facility location problem (Q2455617) (← links)
• The approximation gap for the metric facility location problem is not yet closed (Q2467481) (← links)
• Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
• Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
• Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
• An approximation algorithm for a facility location problem with stochastic demands and inventories (Q2494818) (← links)
• Incremental algorithms for facility location and \(k\)-median (Q2503354) (← links)
• Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
• Approximating \(k\)-median via pseudo-approximation (Q2805513) (← links)
• Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
• Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
• Solving Facility Location Problem Based on Duality Approach (Q2942470) (← links)
• LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
• Dynamic Sum-Radii Clustering (Q2980896) (← links)
• An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem (Q3004653) (← links)
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)